Wireless packet scheduling based on the cumulative distribution function of user transmission rates

In this paper, we present a new wireless scheduling algorithm based on the cumulative distribution function (cdf) and its simple modification that limits the maximum starving time. This cdf-based scheduling (CS) algorithm selects the user for transmission based on the cdf of user rates, in such a way that the user whose rate is high enough, but least probable to become higher, is selected first. We prove that the CS algorithm is equivalent to a scheduling algorithm that regards the user rates as independent and identically distributed, and the average throughput of a user is independent of the probability distribution of other users. So, we can evaluate the exact user throughput only if we know the user's own distribution, which is a distinctive feature of this proposed algorithm. In addition, we try a modification on the CS algorithm to limit the maximum starving time, and prove that the modification does not affect the average interservice time. This CS with starving-time limitation (CS-STL) algorithm turns out to limit the maximum starving time at the cost of a negligible throughput loss.

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

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

[3]  Philip A. Whiting,et al.  The use of diversity antennas in high-speed wireless systems: capacity gains, fairness issues, multi-user scheduling , 2001 .

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

[5]  Boris Tsybakov,et al.  File transmission over wireless fast fading downlink , 2002, IEEE Trans. Inf. Theory.

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

[7]  Arch W. Naylor,et al.  Linear Operator Theory in Engineering and Science , 1971 .

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

[10]  Georgios B. Giannakis,et al.  Outage mutual information of space-time MIMO channels , 2004, IEEE Transactions on Information Theory.

[11]  R. Durrett.  Probability: Theory and Examples , 1993 .

[12]  Thomas L. Marzetta,et al.  Multiple-antenna channel hardening and its implications for rate feedback and scheduling , 2004, IEEE Transactions on Information Theory.