Nearly optimum scheduling in mobile CDMA packet radio networks
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Two multi access algorithms for channels with multiple reception capacityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Evaluation of slot allocation strategies for TDMA protocols in packet radio networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fair spatial TDMA channel access protocols for multihop radio networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Distributed assignment algorithms for multihop packet radio networksIEEE Transactions on Computers, 1989
- Fair Algorithms for Maximal Link Activation in Multihop Radio NetworksIEEE Transactions on Communications, 1987
- Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio NetworkIEEE Transactions on Computers, 1987
- Some complexity results about packet radio networks (Corresp.)IEEE Transactions on Information Theory, 1984