Distributed fair scheduling in a wireless LAN

Nitin Vaidya, Anurag Dugar, Seema Gupta, Paramvir Bahl

Research output: Contribution to journalArticle

Abstract

Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows sharing the channel. This paper presents a fully distributed algorithm for fair scheduling in a wireless LAN. The algorithm can be implemented without using a centralized coordinator to arbitrate medium access. The proposed protocol is derived from the Distributed Coordination Function in the IEEE 802.11 standard. Simulation results show that the proposed algorithm is able to schedule transmissions such that the bandwidth allocated to different flows is proportional to their weights. An attractive feature of the proposed approach is that it can be implemented with simple modifications to the IEEE 802.11 standard.

Original languageEnglish (US)
Pages (from-to)167-178
Number of pages12
JournalProceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM
Volume4
Issue number6
DOIs
StatePublished - Jan 1 2000

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this