Spatial fairness in linear random-access networks

P.M. Ven, van de, J.S.H. Leeuwaarden, van, T.J.J. Denteneer, A.J.E.M. Janssen

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)

Abstract

Random-access networks may exhibit severe unfairness in throughput, in the sense that some nodes receive consistently higher throughput than others. Recent studies show that this unfairness is due to local differences in the neighborhood structure: nodes with fewer neighbors receive better access. We study the unfairness in saturated linear networks, and adapt the random-access CSMA protocol to remove the unfairness completely, by choosing the activation rates of nodes as a specific function of the number of neighbors. We then investigate the consequences of this choice of activation rates on the network-average saturated throughput, and we show that these rates perform well in non-saturated settings.
Original languageEnglish
Pages (from-to)121-134
JournalPerformance Evaluation
Volume69
Issue number3-4
DOIs
Publication statusPublished - 2012

Fingerprint Dive into the research topics of 'Spatial fairness in linear random-access networks'. Together they form a unique fingerprint.

Cite this