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

J. Ghaderi, S.C. Borst, P.A. Whiting

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
101 Downloads (Pure)

Abstract

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
Title of host publicationWorkshop on Mathematical Performance Modeling an Analysis (MAMA 2013, Pittsburg PA, USA, June 21, 2013, in conjunction with ACM SIGMETRICS 2013)
Place of PublicationNew York NY
PublisherAssociation for Computing Machinery, Inc
Pages19-21
DOIs
Publication statusPublished - 2014

Publication series

NameACM SIGMETRICS Performance Evaluation Review
Volume41(3)
ISSN (Print)0163-5999

Fingerprint

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