Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
We present several distributed CDMA/OVSF code assignment algorithms for wireless adhoc networks modelled by unit disk graph (UDG). We first give a distributed code assignment whose total throughput is within a constant factor of the optimum. Then we give a distributed method such that the minimum rate achieved is within a constant factor of the optimum. A distributed method that can approximate both the minimum rate and total throughput is also presented. All our methods use only O(n) total messages (each with O(logn) bits) for an ad hoc wireless network of n nodes modelled by UDG.
CDMA code assignment coloring throughput bottleneck interference wireless networks
Xiang-Yang Li Peng-Jun Wan
Illinois Institute of Technology, Chicago, IL, USA Illinois Institute of Technology, Chicago, IL, USA Hong Kong City University, Hong Kong, China
国际会议
The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)
昆明
英文
126-135
2005-08-01（万方平台首次上网日期，不代表论文的发表时间）