Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks

TL;DR

This paper introduces VLS, a distributed scheduling algorithm for wireless networks that achieves weighted fairness and high throughput by using variable transmission lengths, improving performance under channel imperfections.

Contribution

The paper presents VLS, a novel distributed scheduling method that ensures fairness and high throughput in wireless networks with variable channel conditions, compatible with IEEE 802.11.

Findings

VLS provides weighted fairness among stations.

VLS achieves smoother throughput suitable for real-time applications.

VLS is compatible with existing 802.11 MAC protocols.

Abstract

The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC contentions and dynamics. Moreover, asymmetric channel conditions such as those caused by capture and channel errors often lead to severe unfairness among stations. In this paper we propose a novel distributed scheduling algorithm that we call VLS, for ``{\em variable-length scheduling}'', that provides weighted fairness to all stations despite the imperfections of the MAC layer and physical channels. Distinct features of VLS include the use of variable transmission lengths based on distributed observations, compatibility with 802.11's contention window algorithm, opportunistic scheduling to achieve high throughput in time-varying wireless environments, and flexibility and ease of implementation. Also, VLS makes the throughput of each station more smooth, which is appealing to real-time applications such as video and voice. Although the paper mostly assumes 802.11 protocol, the idea generally applies to wireless networks based on CSMA (Carrier Sensing Multiple Access).