Distributed dynamic channel access scheduling for ad hoc networks

Three types of collision-free channel access protocols for ad hoc networks are presented. These protocols are derived from a novel approach to contention resolution that allows contending entities to elect one or multiple winners for channel access in any given contention context (e.g., a time slot) in a distributed fashion. The only required information for each entity is the identifiers of its neighbors one and two hops away in the wireless network. The new protocols are shown to be fair and capable of achieving maximal utilization of the channel bandwidth. The delay and throughput characteristics of the contention resolution algorithms are analyzed, and the performance of the three types of channel access protocols is studied by simulations and compared with that of optimal static scheduling algorithms.

[1]  Alan A. Bertossi,et al.  Code assignment for hidden terminal interference avoidance in multihop packet radio networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[2]  Limin Hu,et al.  Distributed code assignments for CDMA packet radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[3]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

[4]  Tarek Makansi,et al.  Transmitter-Oriented Code Assignment for Multihop Packet Radio , 1987, IEEE Trans. Commun..

[5]  Chenxi Zhu,et al.  A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks , 2001, Wirel. Networks.

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

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

[8]  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'.

[9]  Mario Joa-Ng,et al.  Spread spectrum medium access protocol with collision avoidance in mobile ad-hoc wireless network , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  L. Kleinrock,et al.  Packet Switching in Radio Channels : Part Il-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution , 2022 .

[11]  J. J. Garcia-Luna-Aceves,et al.  A protocol for topology-dependent transmission scheduling in wireless networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[12]  Imrich Chlamtac,et al.  Fair Algorithms for Maximal Link Activation in Multihop Radio Networks , 1987, IEEE Trans. Commun..

[13]  J. J. Garcia-Luna-Aceves,et al.  Reversing the collision-avoidance handshake in wireless networks , 1999, MobiCom.

[14]  P. W. Baier.  CDMA or TDMA? CDMA for GSM? , 1994, 5th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Wireless Networks - Catching the Mobile Future..

[15]  A. Eizenhofer,et al.  Radio access protocol of the new GSM land mobile communication standard , 1988, 38th IEEE Vehicular Technology Conference.

[16]  R. Larsen,et al.  Introduction to Probability and Its Applications , 1985 .

[17]  Oded Goldreich,et al.  On the np-completeness of certain network testing problems , 1984, Networks.

[18]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[19]  Keshab K. Parhi,et al.  Distributed scheduling of broadcasts in a radio network , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[21]  S. Ramanathan,et al.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[22]  Timothy J. Shepard,et al.  A channel access scheme for large dense packet radio networks , 1996, SIGCOMM '96.

[23]  J.J. Garcia-Luna-Aceves,et al.  Distributed assignment of codes for multihop packet-radio networks , 1997, MILCOM 97 MILCOM 97 Proceedings.

[24]  Ronald L. Rivest,et al.  The MD4 Message-Digest Algorithm , 1990, RFC.

[25]  I. Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[26]  J. J. Garcia-Luna-Aceves,et al.  Solutions to hidden terminal problems in wireless networks , 1997, SIGCOMM '97.