Random access in wireless networks: how much aggressiveness can cause instability?

Javad Ghaderi, Sem Borst, Phil Whiting

Research output: Contribution to journalConference paperpeer-review

1 Citation (Scopus)


Random access schemes are simple and inherently distributed, yet capable of matching the optimal throughput performance of centralized scheduling algorithms. The throughput optimality however has been established for activation rules that are relatively sluggish, and may yield excessive queues and delays. More aggressive/persistent access schemes have the potential to improve the delay performance, but it is not clear if they can offer any universal throughput optimality guarantees. In this paper, we identify a limit on the aggressiveness of nodes, beyond which instability is bound to occur in a broad class of networks.

Original languageEnglish
Pages (from-to)19-21
Number of pages3
JournalPerformance Evaluation Review
Issue number3
Publication statusPublished - 2014
Event SIGMETRICS conference - Pittsburgh, PA, Pittsburgh
Duration: 3 Dec 20133 Dec 2013


Dive into the research topics of 'Random access in wireless networks: how much aggressiveness can cause instability?'. Together they form a unique fingerprint.

Cite this