Throughput guarantees for wireless networks with opportunistic scheduling: a comparative study

In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with a given mean and variance of the bit-rate in a time-slot, and a given distribution for the number of time-slots allocated within a time-window. Based on this general result, we evaluate closed-form expressions for the TGVPs for four well-known scheduling algorithms. Through simulations we also show that our TGVP approximation is tight for a realistic network with moving users with correlated channels and realistic throughput guarantees.

[1]  A. Goldsmith,et al.  Capacity of Rayleigh fading channels under different adaptive transmission and diversity-combining techniques , 1999, IEEE Transactions on Vehicular Technology.

[2]  Bang Wang,et al.  Performance of VoIP on HSDPA , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[3]  Catherine Rosenberg,et al.  Opportunistic scheduling policies for wireless systems with short term fairness constraints , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Mohamed-Slim Alouini,et al.  Performance analysis of multiuser selection diversity , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[5]  E. Kreyszig,et al.  Advanced Engineering Mathematics. , 1974 .

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

[7]  Dapeng Wu,et al.  Utilizing multiuser diversity for efficient support of quality of service over a fading channel , 2005, IEEE Transactions on Vehicular Technology.

[8]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[9]  David Gesbert,et al.  QRP07-1: Throughput Guarantees for Wireless Networks with Opportunistic Scheduling , 2006, IEEE Globecom 2006.

[10]  Norman C. Beaulieu,et al.  An infinite series for the computation of the complementary probability distribution function of a sum of independent random variables and its application to the sum of Rayleigh random variables , 1990, IEEE Trans. Commun..

[11]  D. Gesbert,et al.  Throughput guarantees for opportunistic scheduling algorithms: A comparative study , 2006, 2006 International Telecommunications Symposium.

[12]  M. Johansson,et al.  Diversity-enhanced equal access-considerable throughput gains with 1-bit feedback , 2004, IEEE 5th Workshop on Signal Processing Advances in Wireless Communications, 2004..

[13]  Domenico Ferrari.  Client requirements for real-time communication services , 1990 .

[14]  Tommy Svensson,et al.  WINNER MAC for cellular transmission , 2006 .

[15]  한선영.  [서평]「Understanding Networked Multimedia applications and technology」 , 1996 .

[16]  Geir E. Øien,et al.  Spectral Efficiency and Fairness for Opportunistic Round Robin Scheduling , 2006, 2006 IEEE International Conference on Communications.

[17]  Edward W. Knightly,et al.  Opportunistic fair scheduling over multiple wireless channels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Laurence B. Milstein,et al.  Comparison of diversity combining techniques for Rayleigh-fading channels , 1996, IEEE Trans. Commun..

[19]  Alexander L. Stolyar,et al.  Optimal utility based multi-user throughput allocation subject to throughput constraints , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  F. W. Kellaway,et al.  Advanced Engineering Mathematics , 1969, The Mathematical Gazette.

[21]  Heng Wang,et al.  Opportunistic file transfer over a fading channel under energy and delay constraints , 2005, IEEE Transactions on Communications.

[22]  Michael L. Honig,et al.  Wireless scheduling with hybrid ARQ , 2005, IEEE Transactions on Wireless Communications.

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

[24]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .