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

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)
124 Downloads (Pure)


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.
Originele taal-2Engels
TitelWorkshop on Mathematical Performance Modeling an Analysis (MAMA 2013, Pittsburg PA, USA, June 21, 2013, in conjunction with ACM SIGMETRICS 2013)
Plaats van productieNew York NY
UitgeverijAssociation for Computing Machinery, Inc
StatusGepubliceerd - 2014

Publicatie series

NaamACM SIGMETRICS Performance Evaluation Review
ISSN van geprinte versie0163-5999


Duik in de onderzoeksthema's van 'Random access in wireless networks : how much aggressiveness can cause instability?'. Samen vormen ze een unieke vingerafdruk.

Citeer dit