QRP07-1: Throughput Guarantees for Wireless Networks with Opportunistic Scheduling

In this paper we analyze achievable throughput guarantees in wireless time-division multiplexing (TDM) networks. Approximations of the throughput guarantee violation probability (TGVP) for users communicating in time-slotted systems are obtained for any scheduling algorithm with a given mean and variance of the number of bits transmitted in a time- slot and a distribution for the number of time-slots allocated to a user within a time-window. We investigate the corresponding TGVPs for three scheduling algorithms, namely (i) Round Robin Scheduling, (ii) Maximum Carrier-to-Noise Ratio Scheduling, and (iii) Opportunistic Round Robin Scheduling, when the users' channels are independently and identically distributed.

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

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

[3]  Dapeng Wu,et al.  Utilizing multiuser diversity for efficient support of quality of service over a fading channel , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

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

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

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

[8]  Jack M. Holtzman,et al.  Asymptotic analysis of proportional fair algorithm , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).

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

[10]  David Gesbert,et al.  Throughput guarantees for wireless networks with opportunistic scheduling: a comparative study , 2007, IEEE Transactions on Wireless Communications.

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

[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]  Michael L. Honig,et al.  Wireless scheduling with hybrid ARQ , 2005, IEEE Transactions on Wireless Communications.

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

[15]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

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

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

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