An Evolutionary-TDMA Scheduling Protocol (E-TDMA) for Mobile Ad Hoc Networks

A new single channel, time division multiple access (TDMA) scheduling protocol, termed “EvolutionaryTDMA”, is presented for mobile ad hoc networks. The protocol allows nodes in an ad hoc network to reserve conflict-free TDMA slots for transmission to their neighbors. Two topology-dependent schedules are generated and maintained by the protocol: a broadcast schedule suitable for network control traffic and a mixed schedule which combines unicast, multicast and broadcast transmissions for user data traffic. The schedules are frequently updated in an evolutionary manner to maintain conflict-free transmissions. The protocol executes across the entire network simultaneously in a fully-distributed and parallel fashion. Traffic prioritization and Quality of Service (QoS) can be supported. Simulations have shown that the performance of the E-TDMA protocol is close to that of centralized algorithms, while being insensitive to network size in terms of scheduling quality and scheduling overhead. It is a scalable protocol suitable for very large networks, and networks of varying size.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[2]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.

[3]  M.J. Post,et al.  A Distributed Evolutionary Algorithm for Reorganizing Network Communications , 1985, MILCOM 1985 - IEEE Military Communications Conference.

[4]  J. J. Garcia-Luna-Aceves,et al.  Hop reservation multiple access (HRMA) for multichannel packet radio networks , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[5]  Imrich Chlamtac,et al.  An adaptive medium access control (MAC) protocol for reliable broadcast in wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[6]  Bhaskar Ramamurthi,et al.  Packet reservation multiple access for local wireless communications , 1989, IEEE Trans. Commun..

[7]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[8]  T. G. Robertazzi,et al.  Layer net: a new self-organizing network protocol , 1990, IEEE Conference on Military Communications.

[9]  Imrich Chlamtac,et al.  Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network , 1987, IEEE Transactions on Computers.

[10]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[11]  Erdal Arikan,et al.  Some complexity results about packet radio networks , 1983, IEEE Trans. Inf. Theory.

[12]  Dipankar Raychaudhuri,et al.  Packet CDMA Versus Dynamic TDMA for Multiple Access in an Integrated Voice/Data PCN , 1993, IEEE J. Sel. Areas Commun..

[13]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[14]  Victor O. K. Li,et al.  A distributed time-slot assignment protocol for mobile multi-hop broadcast packet radio networks , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[15]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[16]  Israel Cidon,et al.  Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[17]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[18]  S. Ramanathan,et al.  A unified framework and algorithm for (T/F/C)DMA channel assignment in wireless networks , 1997, Proceedings of INFOCOM '97.