Performance of CSMA in multi-channel wireless networks

We analyze the performance of CSMA in multi-channel wireless networks, accounting for the random nature of traffic. Specifically, we assess the ability of CSMA to fully utilize the radio resources and in turn to stabilize the network in a dynamic setting with flow arrivals and departures. We prove that CSMA is optimal in the ad-hoc mode, when each flow goes through a unique dedicated wireless link from a transmitter to a receiver. It is generally suboptimal in infrastructure mode, when all data flows originate from or are destined to the same set of access points, due to the inherent bias of CSMA against downlink traffic. We propose a slight modification of CSMA that we refer to as flow-aware CSMA, which corrects this bias and makes the algorithm optimal in all cases. The analysis is based on some time-scale separation assumption which is proved valid in the limit of large flow sizes.

[1]  Thomas G. Kurtz,et al.  Averaging for martingale problems and stochastic approximation , 1992 .

[2]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[3]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[4]  Alexandre Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[5]  G. Fayolle,et al.  Two coupled processors: The reduction to a Riemann-Hilbert problem , 1979 .

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

[7]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[8]  Mário Serafim Nunes,et al.  Performance evaluation of IEEE 802.11e , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[9]  Prasun Sinha,et al.  Understanding TCP fairness over wireless LAN , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[11]  Thomas Bonald,et al.  On the stability of flow-aware CSMA , 2010, Perform. Evaluation.

[12]  Jian Ni,et al.  Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[13]  Philippe Robert,et al.  Random capture algorithms fluid limits and stability , 2010, 2010 Information Theory and Applications Workshop (ITA).

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

[15]  Ness B. Shroff,et al.  CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model , 2010, 2010 Proceedings IEEE INFOCOM.

[16]  Eytan Modiano,et al.  Dynamic power allocation and routing for time-varying wireless networks , 2005 .

[17]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[18]  Sem C. Borst,et al.  Insensitivity and stability of random-access networks , 2010, Perform. Evaluation.

[19]  Soung Chang Liew,et al.  An adaptive round robin scheduler for head-of-line-blocking problem in wireless LANs , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[20]  Sem C. Borst,et al.  Backlog-based random access in wireless networks: Fluid limits and delay issues , 2011, 2011 23rd International Teletraffic Congress (ITC).

[21]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[22]  Devavrat Shah,et al.  Distributed algorithm and reversible network , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[23]  Jean Walrand,et al.  Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability , 2009, MobiHoc S3 '09.

[24]  Alexandre Proutière,et al.  Throughput of random access without message passing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[25]  Sean P. Meyn.  Transience of Multiclass Queueing Networks Via Fluid Limit Models , 1995 .

[26]  Yaakov Kogan,et al.  Dimensioning bandwidth for elastic traffic in high-speed data networks , 2000, TNET.

[27]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[28]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[29]  J. J. Garcia-Luna-Aceves,et al.  A receiver-initiated collision-avoidance protocol for multi-channel networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[30]  Thomas Bonald,et al.  Enhanced Spatial Reuse in Multi-Cell WLANs , 2009, IEEE INFOCOM 2009.

[31]  Alexandre Proutière,et al.  Resource Allocation over Network Dynamics without Timescale Separation , 2010, 2010 Proceedings IEEE INFOCOM.

[32]  Neil Falkner,et al.  Diffusions, Markov processes and Martingales, vol 2: Ito calculus , 1987 .

[33]  Abhinav Gupta,et al.  Low-complexity distributed scheduling algorithms for wireless networks , 2009 .

[34]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[35]  Philippe Robert.  Stochastic Networks and Queues , 2003 .

[36]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[37]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[38]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

[39]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2007, IEEE Trans. Mob. Comput..

[40]  Sem C. Borst,et al.  Instability of MaxWeight Scheduling Algorithms , 2009, IEEE INFOCOM 2009.

[41]  Nitin H. Vaidya,et al.  Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver , 2004, MobiHoc '04.

[42]  Byung-Seo Kim,et al.  Downlink and uplink resource allocation in IEEE 802.11 wireless LANs , 2005, IEEE Transactions on Vehicular Technology.

[43]  Thomas Bonald,et al.  On flow-aware CSMA in multi-channel wireless networks , 2011, 2011 45th Annual Conference on Information Sciences and Systems.

[44]  Thomas Bonald,et al.  Insensitive Traffic Models for Communication Networks , 2007, Discret. Event Dyn. Syst..

[45]  Koushik Kar,et al.  Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks , 2008, IEEE Transactions on Information Theory.

[46]  L. Rogers,et al.  Diffusions, Markov processes, and martingales , 1979 .

[47]  Devavrat Shah,et al.  Randomized Scheduling Algorithm for Queueing Networks , 2009, ArXiv.

[48]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.

[49]  Philippe Owezarski,et al.  Modeling Internet backbone traffic at the flow level , 2003, IEEE Trans. Signal Process..

[50]  R. Serfozo.  Introduction to Stochastic Networks , 1999 .