Publication 2004 Issue No. 1 - January Abstract - Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Haiyun Luo Articles by Jerry Cheng Articles by Songwu Lu
Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks
January 2004 (vol. 3 no. 1)
pp. 86-98
 ASCII Text x Haiyun Luo, Jerry Cheng, Songwu Lu, "Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 1, pp. 86-98, January, 2004.
 BibTex x @article{ 10.1109/TMC.2004.1261819,author = {Haiyun Luo and Jerry Cheng and Songwu Lu},title = {Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks},journal ={IEEE Transactions on Mobile Computing},volume = {3},number = {1},issn = {1536-1233},year = {2004},pages = {86-98},doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2004.1261819},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Mobile ComputingTI - Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc NetworksIS - 1SN - 1536-1233SP86EP98EPD - 86-98A1 - Haiyun Luo, A1 - Jerry Cheng, A1 - Songwu Lu, PY - 2004KW - Localized algorithmKW - packet schedulingKW - MANET fair queueing.VL - 3JA - IEEE Transactions on Mobile ComputingER -

Abstract—Distributed fair queueing in a multihop, wireless ad hoc network is challenging for several reasons. First, the wireless channel is shared among multiple contending nodes in a spatial locality. Location-dependent channel contention complicates the fairness notion. Second, the sender of a flow does not have explicit information regarding the contending flows originated from other nodes. Fair queueing over ad hoc networks is a distributed scheduling problem by nature. Finally, the wireless channel capacity is a scarce resource. Spatial channel reuse, i.e., simultaneous transmissions of flows that do not interfere with each other, should be encouraged whenever possible. In this paper, we reexamine the fairness notion in an ad hoc network using a graph-theoretic formulation and extract the fairness requirements that an ad hoc fair queueing algorithm should possess. To meet these requirements, we propose Maximize-Local-Minimum Fair Queueing (MLM-FQ), a novel distributed packet scheduling algorithm where local schedulers self-coordinate their scheduling decisions and collectively achieve fair bandwidth sharing. We then propose Enhanced MLM-FQ (EMLM-FQ) to further improve the spatial channel reuse and limit the impact of inaccurate scheduling information resulted from collisions. EMLM-FQ achieves statistical short-term throughput and delay bounds over the shared wireless channel. Analysis and extensive simulations confirm the effectiveness and efficiency of our self-coordinating localized design in providing global fair channel access in wireless ad hoc networks.

[1] J. Bennett and H. Zhang, “$\big. WF^2Q\bigr.$: Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM 96, pp. 120-128, Mar. 1996.
[2] D. Bertsekas and R. Gallager, Data Networks. Prentice Hall, 1987.
[3] V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, MACAW: A Medium Access Protocol for Wireless LANs Proc. ACM Ann. Conf. Special Interest Group on Data Comm. (SIGCOMM), 1994.
[4] D. Chiu and R. Jain, Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks J. Computer Networks and ISDN, vol. 17, no. 1, pp. 1-14, June 1989.
[5] I. Chlamtac and A. Farago, Making Transmission Schedules Immune to Topology Changes in Multihop Packet Radio Networks IEEE/ACM Trans. Networking, vol. 2, no. 1, pp. 23-29, Feb. 1994.
[6] A. Demers, S. Keshav, and S. Shenker, Analysis and Simulation of a Fair Queueing Algorithm Proc. ACM Ann. Conf. Special Interest Group on Data Comm. (SIGCOMM), 1989.
[7] L. Feeney and M. Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment,” Proc. IEEE INFOCOM, 2001.
[8] P. Goyal, H.M. Vin, and H. Cheng, Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks Proc. ACM Ann. Conf. Special Interest Group on Data Comm. (SIGCOMM), 1996.
[9] X.L. Huang and B. Bensaou, On Max-Min Fairness and Scheduling in Wireless Ad hoc Networks: Analytical Framework and Implementation Proc. ACM Ann. Workshop Mobile and Ad Hoc Networking and Computing (MOBIHOC), 2001.
[10] Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications IEEE Standard 802.11, IEEE Computer Society, 1997.
[11] J.-H. Ju and V.Q. Li, An Optimal Topology-Transparent Scheduling Method in Multihop Packet Radio Networks IEEE/ACM Trans. Networking, vol. 6, no. 3, pp. 298-306, June 1998.
[12] V. Kanodia, C. Li, A. Sabharwal, B. Sadeghi, and E. Knightly, Distributed Multi-Hop Scheduling and Medium Access with Delay and Throughput Constraints Proc. ACM Ann. Int'l Conf. Mobile Computing and Networking (MOBICOM), 2001.
[13] V. Kanodia, C. Li, A. Sabharwal, B. Sadeghi, and E. Knightly, Ordered Packet Scheduling in Wireless Ad Hoc Networks: Mechanisms and Performance Analysis Proc. ACM Ann. Workshop Mobile and Ad Hoc Networking and Computing (MOBIHOC), 2002.
[14] S. Lu, V. Bharghavan, and R. Srikant, “Fair Scheduling in Wireless Packet Networks,” IEEE/ACM Trans. Networking, vol. 7, no. 4, pp. 473-489, Aug. 1999.
[15] S. Lu, T. Nandagopal, and V. Bharghavan, Fair Scheduling in Wireless Packet Networks Proc. ACM Ann. Int'l Conf. Mobile Computing and Networking (MOBICOM), 1998.
[16] H. Luo and S. Lu, A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks Proc. IEEE Int'l Conf. Network Protocols, 2000.
[17] H. Luo, S. Lu, and V. Bharghavan, A New Model for Packet Scheduling in Multihop Wireless Networks Proc. ACM Ann. Int'l Conf. Mobile Computing and Networking (MOBICOM), 2000.
[18] T. Ng, I. Stoica, and H. Zhang, Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors Proc. IEEE Conf. Computer Comm. (INFOCOM), 1998.
[19] A.K. Parekh, A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks PhD dissertation LIDS-TR-2089, MIT Laboratory for Information and Decision Systems, 1992.
[20] P. Ramanathan and P. Agrawal, Adapting Packet Fair Queueing Algorithms to Wireless Networks Proc. ACM Ann. Int'l Conf. Mobile Computing and Networking (MOBICOM), 1998.
[21] Z. Tang and J.J. Garcia-Luna-Aceves, A Protocol for Topology-Dependent Transmission Scheduling in Wireless Networks IEEE Wireless Comm. and Networking Conf., 1999.
[22] N.H. Vaidya, P. Bahl, and S. Gupta, Distributed Fair Scheduling in a Wireless LAN Proc. ACM Ann. Int'l Conf. Mobile Computing and Networking (MOBICOM), 2000.
[23] X. Yang and N. Vaidya, Priority Scheduling in Wireless Ad Hoc Networks Proc. ACM Ann. Workshop Mobile and Ad Hoc Networking and Computing (MOBIHOC), 2002.
[24] L. Zhang, VirtualClock: A New Traffic Control Algorithm for Packet Switching Networks Proc. ACM Ann. Conf. Special Interest Group on Data Comm. (SIGCOMM), 1990.

Index Terms:
Localized algorithm, packet scheduling, MANET fair queueing.
Citation:
Haiyun Luo, Jerry Cheng, Songwu Lu, "Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 1, pp. 86-98, Jan. 2004, doi:10.1109/TMC.2004.1261819