Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Distributed Fair Scheduling with Variable Transmission Lengths in IEEE 802.11 Wireless Networks

Libin Jiang and Jean Walrand

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2007-88
July 8, 2007

http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-88.pdf

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 "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 utilization of variable transmission lengths based on distributed observations, compatibility with 802.11¿s contention window algorithm, opportunistic scheduling to achieve high throughput under noisy and time-varying wireless channel conditions, and flexibility and ease of implementation.


BibTeX citation:

@techreport{Jiang:EECS-2007-88,
    Author = {Jiang, Libin and Walrand, Jean},
    Title = {Distributed Fair Scheduling with Variable Transmission Lengths in IEEE 802.11 Wireless Networks},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2007},
    Month = {Jul},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-88.html},
    Number = {UCB/EECS-2007-88},
    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 "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 utilization of variable transmission lengths based on distributed observations, compatibility with 802.11¿s contention window algorithm, opportunistic scheduling to achieve high throughput under noisy and time-varying wireless channel conditions, and flexibility and ease of implementation.}
}

EndNote citation:

%0 Report
%A Jiang, Libin
%A Walrand, Jean
%T Distributed Fair Scheduling with Variable Transmission Lengths in IEEE 802.11 Wireless Networks
%I EECS Department, University of California, Berkeley
%D 2007
%8 July 8
%@ UCB/EECS-2007-88
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-88.html
%F Jiang:EECS-2007-88