A framework for opportunistic scheduling in wireless networks

Abstract We present a method, called opportunistic scheduling, for exploiting the time-varying nature of the radio environment to increase the overall performance of the system under certain quality of service/fairness requirements of users. We first introduce a general framework for opportunistic scheduling, and then identify three general categories of scheduling problems under this framework. We provide optimal solutions for each of these scheduling problems. All the proposed scheduling policies are implementable online; we provide parameter estimation algorithms and implementation procedures for them. We also show how previous work by us and others directly fits into or is related to this framework. We demonstrate via simulation that opportunistic scheduling schemes result in significant performance improvement compared with non-opportunistic alternatives.

[1]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[2]  Ness B. Shroff,et al.  Opportunistic transmission scheduling with resource-sharing constraints in wireless networks , 2001, IEEE J. Sel. Areas Commun..

[3]  Gordon L. Stuber,et al.  Principles of Mobile Communication , 1996 .

[4]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[5]  Harold J. Kushner,et al.  Stochastic Approximation Algorithms and Applications , 1997, Applications of Mathematics.

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

[7]  Matthew S. Grob,et al.  CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..

[8]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[9]  Xin Liu.  Opportunistic scheduling in wireless communication networks , 2002 .

[10]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 2002, Wirel. Networks.

[11]  A. Jalali,et al.  Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[12]  Alexander L. Stolyar,et al.  Scheduling algorithms for a mixture of real-time and non-real-time data in HDR , 2001 .

[13]  Alexander L. Stolyar,et al.  Scheduling for multiple flows sharing a time-varying channel: the exponential rule , 2000 .

[14]  Victor O. K. Li,et al.  Scheduling algorithms in broadband wireless networks , 2001, Proc. IEEE.

[15]  Songwu Lu,et al.  A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms , 2002, Wirel. Networks.

[16]  Mohit Agarwal,et al.  Base station scheduling of requests with fixed deadlines , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[18]  Philip A. Whiting,et al.  Dynamic bandwidth allocation algorithms for high-speed data wireless networks , 1998, Bell Labs Technical Journal.

[19]  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.

[20]  Sem C. Borst,et al.  Dynamic rate control algorithms for HDR throughput optimization , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).