Scheduling algorithms for downlink rate allocation in heterogeneous CDMA networks

Aikaterini C. Varsou, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)199-207
Number of pages9
JournalJournal of Communications and Networks
Issue number3
StatePublished - Sep 2002

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications


  • CDMA networks
  • Deadline
  • Heterogeneous traffic
  • Quality-of-service requirements
  • Rate allocation


Dive into the research topics of 'Scheduling algorithms for downlink rate allocation in heterogeneous CDMA networks'. Together they form a unique fingerprint.

Cite this