Optimal time slot assignment in CDMA packet radio networks

We consider the time slot assignment problem in a CDMA packet radio network. Unlike the classical TDMA packet radio networks, a CDMA packet radio network can provide each node with a multiple reception capacity using orthogonal codes. This multiple reception capacity of each node presents a new challenge for channel access protocols. Also we consider non-uniform traffic demand over nodes which has become important due to the increase of subscribers and the introduction of PCS. We present an algorithm for a general system where the number of nodes and the reception capacity can be any positive integers and the traffic demand can be non-uniform. Computational tests show that our algorithm generates excellent solutions in most cases.