A new model for packet scheduling in multihop wireless networks

The goal of packet scheduling disciplines is to achieve fair and maximum allocation of 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 model for packet scheduling 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]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  JuJi-Her,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998 .

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

[4]  N. Vaidya,et al.  Fair Scheduling in Broadcast Environments , 1999 .

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

[6]  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).

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

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

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

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

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

[12]  I. Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

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

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

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

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

[17]  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).

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

[19]  K ParekhAbhay,et al.  A generalized processor sharing approach to flow control in integrated services networks , 1993 .

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