A Packet Scheduling Approach to QoS Support in Multihop Wireless Networks

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.

[1]  B. R. Badrinath,et al.  Rate adaptation schemes in networks with mobile hosts , 1998, MobiCom '98.

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[3]  Sneha Kumar Kasera,et al.  Reliable Multicast in Multi-Access Wireless LANs , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[5]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[6]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[7]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[8]  Paramvir Bahl,et al.  Distributed fair scheduling in a wireless LAN , 2000, IEEE Transactions on Mobile Computing.

[9]  Imrich Chlamtac,et al.  Fair Algorithms for Maximal Link Activation in Multihop Radio Networks , 1987, IEEE Trans. Commun..

[10]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.

[11]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[12]  Kang G. Shin,et al.  Predictive and adaptive bandwidth reservation for hand-offs in QoS-sensitive cellular networks , 1998, SIGCOMM '98.

[13]  J. J. Garcia-Luna-Aceves,et al.  A protocol for topology-dependent transmission scheduling in wireless networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[14]  Ion Stoica,et al.  Queueing Algorithms for Wireless with Location-Dependent Errors , 1998 .

[15]  Kumar Jayantilal Parekn Abhay,et al.  A generalized processor sharing approach to frow control in integrated services networks , 1992 .

[16]  Haiyun Luo,et al.  A self-coordinating approach to distributed fair queueing in ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Edward W. Knightly,et al.  Distributed multi-hop scheduling and medium access with delay and throughput constraints , 2001, MobiCom '01.

[18]  Vaduvur Bharghavan,et al.  MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.

[19]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[20]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

[21]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[22]  Parameswaran Ramanathan,et al.  Adapting packet fair queueing algorithms to wireless networks , 1998, MobiCom '98.

[23]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[24]  Jin-Fu Chang,et al.  Guaranteed quality-of-service wireless access to atm , 1996 .

[25]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.

[26]  Haiyun Luo,et al.  A topology-independent fair queueing model in ad hoc wireless networks , 2000, Proceedings 2000 International Conference on Network Protocols.