Slot allocation strategies for TDMA protocols in multihop packet radio networks
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors derive an upper bound of the minimum time division multiple access (TDMA) frame length of any collision-free node assignment protocol in a packet radio network in which a node has multiple reception capacity. They also derive the optimum TDMA frame length for any fully connected network with large reception capacity. When the total number of nodes in the network is unknown, a heuristics to generate a TDMA protocol with frame length within some upper bound is presented for any network with large reception capacity.Keywords
This publication has 12 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
- Tree-Based Broadcasting in Multihop Radio NetworksIEEE Transactions on Computers, 1987
- 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
- Issues in packet radio network designProceedings of the IEEE, 1987
- On Broadcasting in Radio Networks--Problem Analysis and Protocol DesignIEEE Transactions on Communications, 1985
- Some complexity results about packet radio networks (Corresp.)IEEE Transactions on Information Theory, 1984
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- A short proof of Sperner's lemmaJournal of Combinatorial Theory, 1966