Scheduling algorithms for downlink rate allocation in heterogeneous CDMA networks

The downlink rate scheduling problem is considered for CDMA networks with multiple users carrying packets of heterogeneous traffic (voice/audio only, bursty data only or mixed traffic), with each type having its own distinct quality of service requirements. Several rate scheduling algorithms are developed, the common factor of which is that part of the decision on which users to serve is based on a function of the deadline of their head-of-line packets. An approach of Andrews et al., in which the basic Earliest-Deadline-First algorithm is studied for similar systems, is extended to result in better performance by considering a more efficient power usage and by allowing service of more than one user per timeslot if the power resources permit it. Finally, the performance of the proposed schemes is compared through simulations.

[1]  Andrew J. Viterbi,et al.  On the capacity of a cellular CDMA system , 1991 .

[2]  Aikaterini Varsou,et al.  Rate scheduling for the downlink of CDMA mixed traffic networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[3]  Laurence Mailaender,et al.  Simple inter-cell coordination schemes for a high speed CDMA packet downlink , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[4]  H. V. Poor,et al.  HOLPRO: a new rate scheduling algorithm for the downlink of CDMA networks , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[5]  Anujan Varma.  A General Methodology for Designing Eecient Traac Scheduling and Shaping Algorithms , 1997 .

[6]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.