This Article 
 Bibliographic References 
 Add to: 
Distributed Fair Scheduling in a Wireless LAN
November/December 2005 (vol. 4 no. 6)
pp. 616-629
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.

[1] I. Aad and C. Castelluccia, “Differentiation Mechanisms for IEEE 802.11,” Proc. INFOCOM 2001 Conf., 2001.
[2] J.C.R. Bennett and H. Zhang, “Wf2q: Worst-Case Fair Weighted Fair Queueing,” Proc. INFOCOM '96 Conf., Mar. 1996.
[3] V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, “MACAW: A Media Access Protocol for Wireless LANs,” Proc. ACM SIGCOMM Conf., pp. 212-225, Aug. 1994.
[4] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” Proc. SIGCOMM Conf., Sept. 1995.
[5] D. Eckhardt and P. Steenkiste, “Effort-Limited Fair (ELF) Scheduling for Wireless Networks,” Proc. IEEE INFOCOM 2000 Conf., 2000.
[6] K. Fall and K. Varadhan, “ns Notes and Documentation,” technical report, VINT Project, Univ. of Califonia at Berkeley and Lawrence Berkeley Nat'l Laboratory, 1997.
[7] R. Garces and J.J. Garcia-Luna-Aceves, “Near-Optimum Channel Access Protocol Based on Incremental Collision Resolution and Distributed Transmission Queues,” Proc. IEEE INFOCOM Conf., Mar.-Apr. 1998.
[8] N.H. Vaidya and P. Bahl, “Fair Scheduling In Broadcast Environments,” Technical Report MSR-TR-99-61, Microsoft Research, Aug. 1999.
[9] N.H. Vaidya, P. Bahl, and S. Gupta, “Fair Scheduling in a Wireless LAN,” technical report, Texas A&M Univ., Apr. 2000.
[10] S. Gupta, “Study of Distributed Fair Scheduling in a Wireless LAN,” Master of Science thesis, Texas A&M Univ., May 2000.
[11] R. Jain, G. Babic, B. Nagendra, and C. Lam, “Fairness, Call Establishment Latency and Other Performance Metrics,” Technical Report ATM_Forum/96-1173, ATM Forum Document, Aug. 1996.
[12] M. Gerla, K. Tang, and R. Bagrodia, “TCP Performance in Wireless Multihop Networks,” Proc. IEEE Workshop Mobile Computing Systems and Applications (WMCSA), pp. 41-50, Feb. 1999.
[13] S.J. Golestani, “A Self-Clocked Fair Queueing Scheme for Broadband Applications,” Proc. IEEE INFOCOM Conf., 1994.
[14] P. Goyal, H.M. Vin, and H. Cheng, “Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks,” IEEE/ACM Trans. Networking, vol. 5, pp. 690-704, Oct. 1997.
[15] S. Lu, T. Nandagopal, and V. Bharghavan, “A Wireless Fair Service Algorithm for Packet Cellular Networks,” Proc. ACM MobiCom Conf., 1998.
[16] H. Luo, S. Lu, V. Bharghavan, “A New Model for Packet Scheduling in Multihop Wireless Networks,” Proc. ACM MOBICOM Conf., Aug. 2000.
[17] H. Luo and S. Lu, “A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks,” Proc. IEEE Int'l Conf. Network Protocol, 2000.
[18] T. Nandagopal, S. Lu, and V. Bharghavan, “A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms,” Proc. ACM MobiCom Conf., Aug. 1999.
[19] T.S. Ng, I. Stoica, and H. Zhang, “Packet Fair Queueing: Algorithms for Wireless Networks with Location-Dependent Errors,” Proc. INFOCOM Conf., Mar. 1998.
[20] 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 Trans. Networking, vol. 1, June 1993.
[21] P. Ramanathan and P. Agrawal, “Adapting Packet Fair Queueing Algorithms to Wireless Networks,” Proc. ACM MobiCom Conf., 1998.
[22] A. Dugar, N.H. Vaidya, and P. Bahl, “Priority and Fair Scheduling in a Wireless LAN,” Proc. IEEE Military Comm. Conf. (MILCOM), Oct. 2001.
[23] J.L. Sobrinho and A.S. Krishnakumar, “Real-Time Traffic over the IEEE 802.11 Medium Access Control Layer,” Bell Labs Technical J., pp. 172-187, Autumn 1996.
[24] K. Ramamritham and W. Zhao, “Virtual Time CSMA Protocols for Hard Real-Time Communication,” IEEE Trans. Software Eng., vol. 13, no. 8, pp. 938-952, Aug. 1987.
[25] S.M. Sharrock and D.H. Du, “Efficient CSMA/CD-Based Protocols for Multiple Priority Classes,” IEEE Trans. Computers, vol. 38, no. 7, pp. 943-954, July 1989.
[26] L. Tassiulas and S. Sarkar, “Maxmin Fair Scheduling in Wireless Networks,” Proc. IEEE INFOCOM Conf., pp. 763-772, 2002.
[27] X. Wu, C. Yuen, Y. Gao, H. Wu, B. Li, “Fair Scheduling with Bottleneck Consideration in Wireless Ad-Hoc Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks (ICCCN), pp. 568-572, Oct. 2001.

Index Terms:
Index Terms- Medium access control, wireless networks, weighted fairness, distributed protocols.
Nitin Vaidya, Anurag Dugar, Seema Gupta, Paramvir Bahl, "Distributed Fair Scheduling in a Wireless LAN," IEEE Transactions on Mobile Computing, vol. 4, no. 6, pp. 616-629, Nov.-Dec. 2005, doi:10.1109/TMC.2005.87
Usage of this product signifies your acceptance of the Terms of Use.