Distributed scheduling in wireless data networks with service differentiation

Piyush Gupta, Yogesh Sankarasubramaniam, Alexander Stolyar

Research output: Contribution to journalConference articlepeer-review

Abstract

A class of distributed scheduling algorithms, Regulated Contention Medium Access Control (RCMAC), which provides dynamic prioritized access to users for service differentiation, was discussed. It was found that RCMAC achieves higher throughput when traffic is bursty. In RCMAC the access probabilities of different users pi, i=1,2,..., M , in a slot were found to be dynamic, depending on the user 'state' and some 'system-wide variables' shared among contending users. RCMAC-TBR was shown to achieve significant improvement in user througput.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Distributed scheduling in wireless data networks with service differentiation'. Together they form a unique fingerprint.

Cite this