On the achievable throughput of CSMA under imperfect carrier sensing

Recently, it has been shown that a simple, distributed CSMA algorithm can achieve throughput-optimality. However, the optimality is established under the ideal carrier sensing assumption, i.e., each link can precisely sense the presence of other active links in its neighborhood. This paper, in contrast, investigates the achievable throughput of the CSMA algorithm under imperfect carrier sensing. The main result is that CSMA can achieve an arbitrary fraction of the capacity region if certain access probabilities are set appropriately. To establish this result, we use the perturbation theory of Markov chains.

[1]  Jian Ni,et al.  A Distributed Throughput-Optimal CSMA with Data Packet Collisions , 2010, 2010 Fifth IEEE Workshop on Wireless Mesh Networks.

[2]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[3]  R. Srikant,et al.  On the design of efficient CSMA algorithms for wireless networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[4]  C. D. Meyer,et al.  Comparison of perturbation bounds for the stationary distribution of a Markov chain , 2001 .

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

[6]  Jiaping Liu,et al.  Maximizing Utility via Random Access without Message Passing , 2008 .

[7]  Devavrat Shah,et al.  Efficient Queue-based CSMA with Collisions , 2010, ArXiv.

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

[9]  Eric Vigoda,et al.  A Note on the Glauber Dynamics for Sampling Independent Sets , 2001, Electron. J. Comb..

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

[11]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[12]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

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

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

[15]  N. Vieille,et al.  Perturbed Markov chains , 2003, Journal of Applied Probability.

[16]  Jian Ni,et al.  Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks , 2011, TNET.

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

[18]  J. Walrand,et al.  Approaching Throughput-optimality in a Distributed CSMA Algorithm with Contention Resolution , 2009 .

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

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