Slot allocation strategies for TDMA protocols in multihop packet radio networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 1992, Pages 710-716

  Chou, Arr Mien ^a   Li, Victor O K ^b  

^a NATIONAL TAIWAN NORMAL UNIVERSITY   (Taiwan)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROTOCOLS; FRAME LENGTH; FULLY CONNECTED NETWORKS; MINIMUM TIME; MULTI-HOP PACKET RADIO NETWORKS; PACKET RADIO NETWORKS; RECEPTION CAPACITY; SLOT ALLOCATION; TDMA PROTOCOL; UPPER BOUND;

AIR TRAFFIC CONTROL; PACKET NETWORKS; ALGORITHMS; COMPUTER NETWORKS; HEURISTIC METHODS; PACKET SWITCHING; RADIO TRANSMISSION; SCHEDULING; SIGNAL RECEIVERS; TIME DIVISION MULTIPLEXING;

TIME DIVISION MULTIPLE ACCESS; NETWORK PROTOCOLS;

COMMUNICATION PROTOCOLS; COMPUTER ALGORITHMS; PACKET RADIO NETWORKS; TDMA PROTOCOLS;

EID: 0027005599     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1992.263491     Document Type: Conference Paper

References (14)

1. Erdal Arikan. Some complexity results about packet radio networks. IEEE Trans, on Information The ory, IT-30(4):681-685, July 1984. (Pubitemid 14632086)
2. D. J. Baker and J. Wieselthier. A distributed algorithm for scheduling the activation of links in a self-organizing, mobile, radio network. In Int. Conf. on Commu., Philadelphia, PA, pages 2F.6.1-2F.6.5, 1982.
3. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. University Press, Belfast, Northern Ireland, 1976.
4. Imrich Chlamtac and Shay Kutten. On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans, on Communications, COM-33(12):1240-1246, December 1985. (Pubitemid 16539622)
5. Imrich Chlamtac and Shay Kutten. Tree-based broadcasting in multihop radio networks. IEEE Trans, on Computers, C-36(10):1209-1223, October 1987.
6. Imrich Chlamtac and Anat Lerner. Fair algorithms for maximal link activation in multihop radio networks. IEEE Trans, on Communications, COM-35(7):739-746,July 1987. (Pubitemid 17632149)
7. Imrich Chlamtac and Shlomit S. Pinter. Distributed node organization algorithm for channel access in a multihop dynamic radio network. IEEE Trans, on Computers, C-36:728-737, June 1987. (Pubitemid 17614988)
8. Arr-Mien Chou and Victor O.K. Li. Fair spatial TDMA channel access protocols for multihop radio networks. In IEEE INFOCOM, pages 1064-1073, April 1991.
9. Israel Cidon and Moshe Sidi. Distributed assignment algorithms for multihop packet radio networks. IEEE Trans, on Computers, 38(10):1353-1361, October 1989. (Pubitemid 20618516)
10. Bruce Hajek. Balanced scheduling in a packet synchronized spread spectrum network. In IEEE INFOCOM, pages 56-65, 1983. (Pubitemid 14500318)
11. B. Leiner, D. Nielson, and F.A. Tobagi. Issues in packet radio network design. In Proceedings of the IEEE, volume 75, pages 6-20, January 1987. (Pubitemid 17534864)
12. David Lubell. A short proof of sperner's lemma. Journal of Combinatorial Theory, 1(2):299, September 1966.
13. Rajesh K. Pankaj and Andrew J. Viterbi. Two multi access algorithms for channels with multiple reception capacity. In IEEE TENCON, pages 798-803, India, 1989.
14. David S. Stevens and Mostafa H. Ammar. Evaluation of slot allocation strategies for TDMA protocols in packet radio networks. In IEEE MILCOM, 1990.