Nearly optimum scheduling in mobile CDMA packet radio networks

The authors propose the modulo hunter algorithm, which provides a solution for a mobile CDMA (code division multiple access) network using TDMA (time division multiple access) slot allocation in the case of arbitrary multiple reception capacity. The solution is nearly optimal in the sense that the length of the resulting TDMA frame is guaranteed to be within a small multiple of the best possible. The method is very easy to implement, requires a short execution time, and can be used in a distributed way. It is independent of the particular network topology, which guarantees robustness in the face of topology changes and makes the result especially suitable for mobile CDMA packet radio networks