On the achievable throughput of CSMA under imperfect carrier sensing

Abstract—Recently, it has been shown that a simple, distributed 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 contrast, we investigate 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.

• Type: Journal
• Year: 2011
• Where: INFOCOM
• Authors: Tae Hyun Kim 0001, Jian Ni, R. Srikant, Nitin H. Vaidya
• Keywords: Certain Access Probabilities, Communications, CSMA Algorithm, INFOCOM 2011, Sensing