A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control

In multi-hop ad hoc networks, the efficiency of a medium access control protocol under heavy traffic load depends mainly on its ability to schedule a large number of simultaneous non-interfering transmissions. However, as each node has only a local view of the network, it is difficult to globally synchronize transmission times over the whole network. How does the lack of global coordination affect spatial reuse in multi-hop wireless networks? We show that in a de-centralized network the spatial reuse does not benefit from global clock synchronization. On the contrary, we demonstrate that non-slotted protocols using collision avoidance mechanisms can achieve a higher spatial reuse than the corresponding slotted protocols. By means of a simple backoff mechanism, one can thus favor the spontaneous emergence of spatially dense transmission schedules.

[1]  Jing Deng,et al.  Dual busy tone multiple access (DBTMA): a new medium access control for packet radio networks , 1998, ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384).

[2]  Martin Heusse,et al.  Performance anomaly of 802.11b , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  J Talbot,et al.  Adsorption-desorption model and its application to vibrated granular materials. , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[4]  Stan Zachary,et al.  Loss networks and Markov random fields , 1999 .

[5]  J. Mackenzie.  Sequential Filling of a Line by Intervals Placed at Random and Its Application to Linear Adsorption , 1962 .

[6]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Partha P. Mitra,et al.  Markov random field models of multicasting in tree networks , 2002, Advances in Applied Probability.

[9]  R. Rozovsky,et al.  SEEDEX: a MAC protocol for ad hoc networks , 2001, MobiHoc '01.

[10]  Paul Muhlethaler,et al.  A Spatial Reuse Aloha MAC Protocol for Multihop Wireless Mobile Networks , 2003 .

[11]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[12]  Yuliy Baryshnikov,et al.  Space filling and depletion , 2004, Journal of Applied Probability.

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

[14]  Sanjay Gupta,et al.  Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol , 1997, Wirel. Networks.

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

[16]  J. J. Garcia-Luna-Aceves,et al.  A scalable model for channel access protocols in multihop ad hoc networks , 2004, MobiCom '04.

[17]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[18]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[19]  Yu Wang,et al.  Performance of collision avoidance protocols in single-channel ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..