By Topic

Throughput-Optimal CSMA With Imperfect Carrier Sensing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tae Hyun Kim ; Dept. of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois, Urbana-Champaign ; Jian Ni ; R. Srikant ; Nitin H. Vaidya

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.

Published in:

IEEE/ACM Transactions on Networking  (Volume:21 ,  Issue: 5 )