Li, Xiang-Yang; Wan, Peng-Jun Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks. (English) Zbl 1128.68306 Wang, Lusheng (ed.), Computing and combinatorics. 11th annual international conference, COCOON 2005, Kunming, China, August 16–29, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28061-8/pbk). Lecture Notes in Computer Science 3595, 126-135 (2005). Summary: We present several distributed CDMA/OVSF code assignment algorithms for wireless ad hoc 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(\log n)\) bits) for an ad hoc wireless network of \(n\) nodes modelled by UDG.For the entire collection see [Zbl 1078.68006]. Cited in 5 Documents MSC: 68M10 Network design and communication in computer systems Keywords:CDMA code assignment; coloring; throughput; bottleneck; interference; wireless networks Software:CDMA/OVSF PDFBibTeX XMLCite \textit{X.-Y. Li} and \textit{P.-J. Wan}, Lect. Notes Comput. Sci. 3595, 126--135 (2005; Zbl 1128.68306) Full Text: DOI