On the stability of flow-aware CSMA

Abstract : We consider a wireless network where each flow (instead of each link) runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically , each flow attempts to access the radio channel after some random time and transmits a packet if the channel is sensed idle. We prove that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable for all traffic intensities in the capacity region of the network.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01244058
Contributor : Thomas Bonald <>
Submitted on : Tuesday, December 15, 2015 - 2:29:42 PM
Last modification on : Wednesday, May 15, 2019 - 3:54:44 AM
Long-term archiving on : Wednesday, March 16, 2016 - 1:41:07 PM

File

BF10.pdf
Files produced by the author(s)

Identifiers

Citation

Thomas Bonald, Mathieu Feuillet. On the stability of flow-aware CSMA. Performance Evaluation, Elsevier, 2010, ⟨10.1016/j.peva.2010.08.001⟩. ⟨hal-01244058⟩

Share

Metrics

Record views

301

Files downloads

191