A code allocation protocol for maximizing throughput in CDMA based ad hoc networks
Saurabh Srivastava, Sachin Tripathi, Dheeraj Sanghi, A. K. Chaturvedi · 2004
We consider here the problem of allocating variable length orthogonal codes in an ad hoc network based on CDMA. We consider a snapshot version of the problem at some instant. It had been proved earlier than even for a static set of communications and topology the problem is intractable. A greedy algorithm is stated to provide a bounded approximation to the throughput maximizing optimal allocation. We present a simple distributed code allocation protocol based on the greedy approximation. Simulation experiments show the enhanced throughput obtained by our protocol as compared to other code allocation schemes.