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: Book/ReportReportAcademic

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.
LanguageEnglish
Place of PublicationEindhoven
PublisherEurandom
Number of pages21
StatePublished - 2011

Publication series

NameReport Eurandom
Volume2011020
ISSN (Print)1389-2355

Fingerprint

random access
activation

Cite this

Ven, van de, P. M., Leeuwaarden, van, J. S. H., Denteneer, T. J. J., & Janssen, A. J. E. M. (2011). Spatial fairness in linear random-access networks. (Report Eurandom; Vol. 2011020). Eindhoven: Eurandom.
Ven, van de, P.M. ; Leeuwaarden, van, J.S.H. ; Denteneer, T.J.J. ; Janssen, A.J.E.M./ Spatial fairness in linear random-access networks. Eindhoven : Eurandom, 2011. 21 p. (Report Eurandom).
@book{142cca1214ce40719110bb6ae181593c,
title = "Spatial fairness in linear random-access networks",
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.",
author = "{Ven, van de}, P.M. and {Leeuwaarden, van}, J.S.H. and T.J.J. Denteneer and A.J.E.M. Janssen",
year = "2011",
language = "English",
series = "Report Eurandom",
publisher = "Eurandom",

}

Ven, van de, PM, Leeuwaarden, van, JSH, Denteneer, TJJ & Janssen, AJEM 2011, Spatial fairness in linear random-access networks. Report Eurandom, vol. 2011020, Eurandom, Eindhoven.

Spatial fairness in linear random-access networks. / Ven, van de, P.M.; Leeuwaarden, van, J.S.H.; Denteneer, T.J.J.; Janssen, A.J.E.M.

Eindhoven : Eurandom, 2011. 21 p. (Report Eurandom; Vol. 2011020).

Research output: Book/ReportReportAcademic

TY - BOOK

T1 - Spatial fairness in linear random-access networks

AU - Ven, van de,P.M.

AU - Leeuwaarden, van,J.S.H.

AU - Denteneer,T.J.J.

AU - Janssen,A.J.E.M.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

M3 - Report

T3 - Report Eurandom

BT - Spatial fairness in linear random-access networks

PB - Eurandom

CY - Eindhoven

ER -

Ven, van de PM, Leeuwaarden, van JSH, Denteneer TJJ, Janssen AJEM. Spatial fairness in linear random-access networks. Eindhoven: Eurandom, 2011. 21 p. (Report Eurandom).