Optimum Throughput Constrained Opportunistic Scheduling in Cellular Data Networks

This paper considers the problem of scheduling multiple users in the downlink of a time-slotted cellular data network. For such a network, opportunistic scheduling algorithms exploit the time-varying radio channel and improve the system performance. This paper introduces a new optimum scheduling algorithm that maximizes the sum of average user performance subject to certain minimum and maximum performance constraints. The proposed algorithm, which is named as throughput constrained opportunistic scheduling (TCOS), is an extension of the framework proposed by Liu et al. For memory less fading channels, TCOS performs identically to another optimum algorithm. For fading channels with memory, TCOS significantly improves system performance. The TCOS with the minimum and maximum performance constraints offers better service differentiation among different classes of users than opportunistic scheduling algorithm provides with only minimum performance constraints

[1]  Hong Shen Wang,et al.  Finite-state Markov channel-a useful model for radio communication channels , 1995 .

[2]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[3]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[4]  Leandros Tassiulas,et al.  Exploiting wireless channel State information for throughput maximization , 2004, IEEE Trans. Inf. Theory.

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

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

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

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

[9]  R. Srikant,et al.  Scheduling with QoS constraints over Rayleigh fading channels , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

[11]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

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

[13]  Babak Hassibi,et al.  A delay analysis for opportunistic transmission in fading broadcast channels , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Vikram Krishnamurthy,et al.  Opportunistic scheduling for streaming users in high-speed downlink packet access (HSDPA) , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

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

[16]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[17]  Ness B. Shroff,et al.  A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.

[18]  Georgios B. Giannakis,et al.  Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design , 2005, IEEE Transactions on Wireless Communications.

[19]  Philip A. Whiting,et al.  Convergence of proportional-fair sharing algorithms under general conditions , 2004, IEEE Transactions on Wireless Communications.