Nitin H. Vaidya
Paramvir Bahl
ABSTRACT
Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weightsof 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 transmission 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.
- 1.J. C. R. Bennett and H. Zhang, "Wf2q: Worst-case fair weighted fair queueing," in INFOCOM'96, March 1996. Google Scholar
Digital Library
- 2.V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, "MACAW: A media access protocol for wireless LANs," in A CM SIGCOMM, pp. 212-225, August 1994. Google ScholarDigital Library
- 3.G. L. Choudhury and S. S. Rappaport, "Priority access schemes using CSMA-CD,' IEEE Transactions on Communications, vol. COM-33, pp. 620-626, July 1985.Google Scholar
- 4.A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," in Proc. SIGCOMM, September 1995. Google ScholarDigital Library
- 5.D. Eckhardt, P. Steenkiste, "Effort-limited Fair (ELF) Scheduling for Wireless Networks," In Proc. IEEE INFOCOM 2000.Google Scholar
- 6.K. Fall and K. Varadhan, "ns Notes and documentation," tech. rep., VINT Project, UC-Berkeley and LBNL, 1997.Google Scholar
- 7.R. Garces and J. J. Garcia-Luna-Aceves, "Near-optimum channel access protocol based on incremental collision resolution and distributed transmission queues," in IEEE INFOCOM, San Francisco, March-April 1998.Google Scholar
- 8.M. Gerla, K. Tang, and It. Bagrodia, "TCP performance in wireless multi-hop networks," in IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pp. 41-50, February 1999. Google ScholarDigital Library
- 9.S. J. Golestani, "A self-clocked fair queueing scheme for broadband applications," in IEEE INFOCOM, 1994.Google Scholar
- 10.P. Goyal, H. M. Vin, and H. Cheng, "Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks," IEEE/A CM Transactions on Networking, vol. 5, pp. 690-704, October 1997. Google ScholarDigital Library
- 11.S. Gupta, "Study of distributed fair scheduling in a wireless LAN," Master of Science thesis in preparation, Texas A&M University, May 2000.Google Scholar
- 12.IEEE, "IEEE std 802.11 - wireless LAN medium access control (MAC) and physical layer (PHY) specifications," 1997.Google Scholar
- 13.R. Jain, G. Babic, B. Nagendra, and C. Lam, "Fairness, call establishment latency and other performance metrics," Tech. Rep. ATM_Forum/96-1173, ATM Forum Document, August 1996.Google Scholar
- 14.S. Keshav, "On the efficient implementation of fair queueing,' Journal o.f Internetworkin#: Research and Ezperience, vol. 2, pp. 57-73, September 1991.Google Scholar
- 15.C. E. Koksal, H. I. Kassab, H. Balakrishnan, "An Analysis of Short-Term Fairness in Wireless Media Access Protocols," Extended version of short paper to appear in Proc. A CM SIGMETRICS, June 2000. Google ScholarDigital Library
- 16.S. Lu, T. Nandagopal, and V. Bharghavan, "A wireless fair service algorithm for packet cellular networks," in A CM MobiCorn, 1998. Google ScholarDigital Library
- 17.T. Nandagopal, S. Lu, and V. Bharghavan, "A unified architecture for the design and evaluation of wireless fair queueing algorithms," in A CM MobiCom, August 1999. Google ScholarDigital Library
- 18.T. S. Ng, I. Stoica, and H. Zhang, "Packet fair queueing: Algorithms for wireless networks with location-dependent errors," in INFOCOM, March 1998.Fair queuing in wireless networksGoogle Scholar
- 19.A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Transactions on Networking, vol. 1, June 1993. Google ScholarDigital Library
- 20.P. Ramanathan and P. Agrawal, "Adapting packet fair queueing algorithms to wireless networks," in A CM MobiCorn, 1998. Google ScholarDigital Library
- 21.S. M. Sharrock and D. H. Du, "Efficient CSMA/CD-based protocols for multiple priority classes," IEEE ~t'ansactions on Computers, vol. 38, pp. 943-954, July 1989. Google ScholarDigital Library
- 22.M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round robin," in ${G COMM '95, Cambridge, MA, USA, 1995. Google ScholarDigital Library
- 23.J. L. Sobrinho and A. S. Krishnakumar, "Real-time traffic over the IEEE 802.11 medium access control layer," Bell Labs Technical Journal, pp. 172-187, Autumn 1996.Google Scholar
- 24.N. H. Vaidya and P. Bahl, "Fair scheduling in broadcast environments," Tech. Rep. MSR-TR-99-61, Microsoft Research, August 1999.Google Scholar
Index Terms
- Distributed fair scheduling in a wireless LAN
Recommendations
Distributed Fair Scheduling in a Wireless LAN
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 ...
A distributed fair scheduling scheme in wireless LAN
AbstractThis paper proposes an algorithm named WLFVC, which is a fully distributed wireless packet scheduling algorithm based on LFVC (Leap Forward Virtual Clock), to provide streams with fairness, especially in the short time scale. This algorithm is ...
Fair TDMA scheduling in wireless multihop networks
In wireless multihop networks, communication between two end-nodes is carried out by hopping over multiple wireless links. However, the fact that each node has to transmit not only its own traffic, but also traffic on behalf of other nodes, leads to ...
Comments