Multihop CDMA wireless networks with a large number of stationswould require a large number of spreading codes, even with code reusebeyond the interference range. In this paper, we propose the leastconflict sharable code assignment algorithm to reduce the number ofcodes needed and at the same time avoid code collisions as far aspossible. We also introduce the mean conflictness of a network as aperformance index of code assignment algorithms. Numerical results showthat this new algorithm can reduce nearly 20 percent of the meanconflictness when compared to randomly sharing the codes
展开▼
