On the fairness of large CSMA networks

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of these protocols in small network topologies does not always persist in large topologies. In regular networks, 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 1D lattice 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 2D lattice 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. In irregular networks, the topology is inherently unfair. This unfairness increases with the access intensity of the protocol, but in a much smoother way than in regular two-dimensional networks. Finally, in situations where the protocol is long-term fair, we provide a characterization of its short-term fairness.

[1]  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.

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

[3]  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.

[4]  The random geometry of equilibrium phases , 1999, math/9905031.

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

[6]  Asuman E. Ozdaglar,et al.  Achievable rate region of CSMA schedulers in wireless networks with primary interference constraints , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[8]  Patrick Thiran,et al.  Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness , 2009, IEEE Transactions on Information Theory.

[9]  Alexandre Proutière,et al.  Performance of random medium access control, an asymptotic approach , 2008, SIGMETRICS '08.

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

[11]  Patrick Thiran,et al.  Border Effects, Fairness, and Phase Transition in Large Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

[13]  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.

[14]  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.

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

[16]  Hari Balakrishnan,et al.  An analysis of short-term fairness in wireless media access protocols (poster session) , 2000, SIGMETRICS '00.

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

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

[19]  Konstantinos Psounis,et al.  The achievable rate region of 802.11-scheduled multihop networks , 2009, TNET.

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

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

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

[23]  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.

[24]  Olle Häggström,et al.  Nonmonotonic Behavior in Hard-Core and Widom–Rowlinson Models , 1999 .

[25]  Michele Garetto,et al.  Modeling media access in embedded two-flow topologies of multi-hop wireless networks , 2005, MobiCom '05.

[26]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

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

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

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