Border Effects, Fairness, and Phase Transition in Large Wireless Networks

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of the protocol in small network topologies does not always persist in large topologies. This unfairness is essentially due to the unfair advantage of nodes at the border of the network, which have a restricted neighborhood and thus a higher probability to access the communication channel. In large one-dimensional networks these border effects do not propagate inside the network, and nodes sufficiently far away from the border have equal access to the channel; as a result the protocol is long-term fair. In two-dimensional networks, we observe a phase transition. If the access intensity of the protocol is small, the border effects remain local and the protocol behaves similarly as in one- dimensional networks. However, if the access intensity of the protocol is large enough, the border effects persist independently of the size of the network and the protocol is strongly unfair. Finally, in situations where the protocol is long-term fair, we provide a characterization of its short-term fairness.

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

[2]  Isabelle Guérin Lassous,et al.  Experiments of Some Performance Issues with IEEE 802.11b in Ad Hoc Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[3]  Patrick Thiran,et al.  A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[5]  Fouad A. Tobagi,et al.  Towards Performance Modeling of IEEE 802.11 Based Wireless Networks: A Unified Framework and Its Applications , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Koushik Kar,et al.  Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[7]  Michele Garetto,et al.  Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Kavita Ramanan,et al.  Nonmonotonicity of phase transitions in a loss network with controls , 2006, math/0610321.

[9]  J. Laurie Snell,et al.  Markov Random Fields and Their Applications , 1980 .

[10]  J. Berg,et al.  A uniqueness condition for Gibbs measures, with application to the 2-dimensional Ising antiferromagnet , 1993 .

[11]  Yechiam Yemini Astatistical Mechanics of Distributed Resource Sharing Mechanisms , 1983, INFOCOM.

[12]  Van den Berg,et al.  Disagreement percolation in the study of Markov fields , 1994 .

[13]  F.A. Tobagi,et al.  Modeling and performance analysis of multihop packet radio networks , 1987, Proceedings of the IEEE.

[14]  Ole J. Heilmann,et al.  The use of reflection as symmetry operation in connection with Peierls' argument , 1974 .

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

[16]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[17]  Patrick Thiran,et al.  Understanding the Gap between the IEEE 802.11 Protocol Performance and the Theoretical Limits , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[18]  Ole J. Heilmann,et al.  Phase transition of hard hexagons on a triangular lattice , 1973 .