Distributed fair scheduling in a wireless LAN

被引:0
作者
Vaidya, N
Dugar, A
Gupta, S
Bahl, P
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[2] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[3] OPNET Technol Inc, Bethesda, MD 20878 USA
[4] Cisco Syst Inc, Milpitas, CA 95035 USA
[5] Microsoft Res, Redmond, WA 98052 USA
关键词
medium access control; wireless networks; weighted fairness; distributed protocols;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:616 / 629
页数:14
相关论文
共 27 条
  • [1] AAD I, 2001, P INFOCOM 2001 C
  • [2] [Anonymous], NS NOTES DOCUMENTATI
  • [3] BENNETT JCR, 1996, P INFOCOM 96 C MAR
  • [4] Bharghavan V., 1994, Computer Communication Review, V24, P212, DOI 10.1145/190809.190334
  • [5] DEMERS A, 1995, P SIGCOMM C SEPT
  • [6] DUGAR A, 2001, P IEEE MIL COMM C MI
  • [7] ECKHARDT D, 2000, P IEEE INFOCOM 2000
  • [8] GARCES R, 1998, P IEEE INFOCOM C MAR
  • [9] TCP performance in wireless multi-hop networks
    Gerla, M
    Tang, K
    Bagrodia, R
    [J]. WMCSA '99, SECOND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 1999, : 41 - 50
  • [10] GOLESTANI SJ, 1994, P IEEE INFOCOM C