Abstract
Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in bandwidth-constrained, shared-channel, multihop wireless networks. Packet scheduling has been a very popular paradigm to ensure minimum throughput and bounded delay access for packet flows. This work describes a packet scheduling approach to QoS provisioning in multihop wireless networks. Besides minimum throughput and delay bounds for each flow, our scheduling disciplines seek to achieve fair and maximum allocation of the shared wireless channel bandwidth. However, these two criteria can potentially be in conflict in a generic-topology multihop wireless network where a single logical channel is shared among multiple contending flows and spatial reuse of the channel bandwidth is possible. In this paper, we propose a new scheduling model that addresses this conflict. The main results of this paper are the following: (a) a two-tier service model that provides a minimum “fair” allocation of the channel bandwidth for each packet flow and additionally maximizes spatial reuse of bandwidth, (b) an ideal centralized packet scheduling algorithm that realizes the above service model, and (c) a practical distributed backoff-based channel contention mechanism that approximates the ideal service within the framework of the CSMA/CA protocol.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.C.R. Bennett and H. Zhang, WF2Q: Worst-case fair weighted fair queueing, in: Proc. of IEEE INFOCOM'96, Vol. 1 (1996) pp. 120–128.
V. Bharghavan, A new protocol for medium access in wireless packet networks, online document (1999).
V. Bharghavan, A. Demers, S. Shenker and L. Zhang, MACAW: A medium access protocol for wireless LANs, in: Proc. of ACM SIGCOMM'94, Vol. 24 (1994) pp. 212–225.
C. Chang, J. Chang, K. Chen and M. You, Guaranteed quality-of-service wireless access to ATM, IEEE J. Selected Areas Commun. 15 (1997) 106–118.
I. Chlamtac and A. Farago, Making transmission schedules immune to topology changes in multi-hop packet radio networks, IEEE/ACM Trans. Networking 2(1) (February 1994) 23–29.
I. Chlamtac and A. Lerner, Fair algorithms for maximal link activation in multihop radio networks, IEEE Trans. Communications 35(7) (July 1987) 739–746.
S. Choi and K.G. Shin, Predictive and adaptive bandwidth reservation for hand-offs in QoS-sensitive cellular networks, in: Proc. of ACM SIGCOMM'98, Vol. 28 (1998) pp. 155–166.
P. Crescenzi and V. Kann, A compendium of NP optimization problems, http://www.nada.kth.se/ viggo/indexen.html.
A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, in: Proc. of ACM SIGCOMM'89, Vol. 19 (August 1989) pp. 1–12.
P. Goyal, H.M. Vin and H. Chen, Start-time fair queueing: A scheduling algorithm for integrated service access, in: Proc. of ACM SIGCOMM'96, Vol. 5 (August 1996) pp. 690–704.
M.M. Halldorsson and J. Radhakrishnan, Greed is good: Approximating independent sets in sparse and bounded-degree graphs, in: Proc. of ACM STOC'94 (1994) pp. 439–448.
J. Ju and V.O.K. Li, An optimal topology-transparent scheduling method in multihop packet radio networks, IEEE Trans. Networking 6(3) (June 1998) 298–306.
V. Kanodia, C. Li, A. Sabharwal, B. Sadeghi and E. Knightly, Distributed multi-hop scheduling with delay and throughput constraints, in: Proc. of ACM MOBICOM'01, Rome, Italy (July 2001) pp. 200–209.
J. Kuri and S. Kasera, Reliable multicast in multi-access wireless LANs, in: Proc. of IEEE INFOCOM'99, Vol. 7 (1999) pp. 359–369.
S. Lu, V. Bharghavan and R. Srikant, Fair scheduling in wireless packet networks, IEEE Trans. Networking 7 (August 1999) 473–489.
S. Lu, T. Nandagopal and V. Bharghavan, Fair scheduling in wireless packet networks, in: Proc. of ACM MOBICOM'98, Vol. 29 (October 1998) pp. 63–67.
H. Luo and S. Lu, A topology-independent fair queueing model in ad hoc wireless networks, in: Proc. of IEEE ICNP'00, Osaka, Japan (November 2000) pp. 325–335.
H. Luo, P. Medvedev, J. Cheng and S. Lu, A self-coordinating approach to distributed fair queueing in ad hoc wireless networks, in: Proc. of IEEE INFOCOM, Anchorage, Alaska, Vol. 3 (April 2001) pp. 1370–1379.
T. Nandagopal, T. Kim, X. Gao and V. Bharghavan, Achieving MAC Layer Fairness in Wireless Packet Networks, in: Proc. of ACM MOBICOM'00, Boston, MA (August 2000) pp. 87–98.
T.S. Ng, I. Stoica and H. Zhang, Packet fair queueing algorithms for wireless networks with location-dependent errors, in: Proc. of IEEE INFOCOM'98, Vol. 8 (March 1998) pp. 1103–1111.
A. Parekh, A generalized processor sharing approach to flow control in integrated services networks, PhD Thesis, MIT Laboratory for Information and Decision Systems, Technical Report LIDS-TR-2089 (1992).
P. Ramanathan and P. Agrawal, Adapting packet fair queueing algorithms to wireless networks, in: Proc. of ACM MOBICOM'98 (October 1998) pp. 1–9.
A.K. Talukdar and B.R. Badrinath, Rate adaptation schemes in networks with mobile hosts, in: ACM MOBICOM'98 (1998) pp. 169–180.
Z. Tang and J.J. Garacia-Luna-Aceves, A protocol for topology-dependent transmission scheduling in wireless networks, in: Proc. of WCNC'99, Vol. 3 (September 1999) pp. 1333–1337.
N. Vaidya, P. Bahl and S. Gupta, Distributed fair scheduling in a wireless LAN, in: Proc. of ACM MOBICOM'00, Boston, MA (August 2000) pp. 167–178.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Luo, H., Lu, S., Bharghavan, V. et al. A Packet Scheduling Approach to QoS Support in Multihop Wireless Networks. Mobile Networks and Applications 9, 193–206 (2004). https://doi.org/10.1023/B:MONE.0000020643.70011.c7
Issue Date:
DOI: https://doi.org/10.1023/B:MONE.0000020643.70011.c7