On flow-aware CSMA in multi-channel wireless networks

We consider a multi-channel wireless network with flow-aware CSMA, which consists in running one instance of the CSMA algorithm per active flow. Specifically, each such instance attempts to access a randomly chosen radio channel after some random time and transmits a packet of the corresponding flow if the channel is sensed idle. We prove that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable for all traffic intensities in the capacity region of the network.

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

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

[3]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

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

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

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

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

[8]  WalrandJean,et al.  A distributed CSMA algorithm for throughput and utility maximization in wireless networks , 2010 .

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

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

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

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

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

[14]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[15]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

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

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

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

[19]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .