Throughput-optimal CSMA with imperfect carrier sensing

Tae Hyun Kim, Jian Ni, Rayadurgam Srikant, Nitin H Vaidya

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Article number6410450
Pages (from-to)1636-1650
Number of pages15
JournalIEEE/ACM Transactions on Networking
Volume21
Issue number5
DOIs
StatePublished - Jan 18 2013

Keywords

  • Distributed algorithm
  • Fault tolerance
  • Medium access control
  • Network capacity
  • Throughput optimality
  • Wireless scheduling

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Throughput-optimal CSMA with imperfect carrier sensing'. Together they form a unique fingerprint.

Cite this