Throughput-optimal CSMA with imperfect carrier sensing

Authors:
Tae Hyun Kim;Jian Ni;R. Srikant;Nitin H. Vaidya
Affiliations:
Department of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;IBM T. J. Watson Research Center, Yorktown Heights, NY;Department of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 11
Cited 0

Data networks (2nd ed.)

Data networks (2nd ed.)
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Performance of random medium access control, an asymptotic approach

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
A distributed CSMA algorithm for throughput and utility maximization in wireless networks

IEEE/ACM Transactions on Networking (TON)
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions

IEEE/ACM Transactions on Networking (TON)
Medium Access Using Queues

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications
Q-CSMA: queue-length-based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, it has been shown that a simple, distributed backlog-based carrier-sense multiple access (CSMA) algorithm is throughput-optimal. However, throughput optimality is established under the perfect or ideal carrier-sensing assumption, i.e., each link can precisely sense the presence of other active links in its neighborhood. In this paper, we investigate the achievable throughput of the CSMA algorithm under imperfect carrier sensing. Through the analysis on both false positive and negative carrier sensing failures, we show 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.