Distributed fair scheduling in a wireless LAN

By Nitin H. Vaidya, A. Dugar, Seema Gupta, Paramvir Victor Bahl. IEEE Transactions on Mobile Computing, 2000

725 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/0dcba0ab293b0e8f632bf0031c570711e3ff8cc7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

A survey of quality of service in IEEE 802.11 networks (2004, background): “Based on the proposed saturation coefficient, Zhu et al. [ 10 ] offer a calculation-based distributed admission control protocol.”
Medium Access Control protocols for ad hoc wireless networks: A survey (2006, methodology): “, distributed fair scheduling [99]) to provide a reasonably fair channel allocation to different flows (often according to their priority).”
Understanding TCP fairness over wireless LAN (2003, background): “Vaidya et al. [4] suggested a clever distributed algorithm that calculates the backoff period for the stations such that the resulted access to the channel will closely match the Self-Clocked Fair Queuing (SCFQ [12]) scheduling.”
Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks (2006, methodology): “We duplicate the experimental setup given by the authors of the distributed fair scheduling (DFS) protocol [10].”
Adaptive EDCF: enhanced service differentiation for IEEE 802.11 wireless ad-hoc networks (2003, methodology): “In this paper, we focus on ad-hoc networks since distributed random access control are often preferred to centrally coordinated access control [10], [11].”
Scheduling in IEEE 802.16e mobile WiMAX networks: key issues and a survey (2009, methodology): “Although, a number of scheduling algorithms have been proposed in the literature such as Fair Scheduling [3], Distributed Fair Scheduling [4], MaxMin Fair Scheduling [5], Channel State Dependent Round Robin (CSD-RR) [6], Feasible Earliest Due Date (FEDD) [7] and Energy Efficient Scheduling [8], thes”