HOLPRO: A new rate scheduling algorithm for the downlink of CDMA networks

Aikaterini C. Varsou, H. Vincent Poor

Research output: Contribution to journalConference articlepeer-review

16 Scopus citations


The rate scheduling problem for the downlink of CDMA networks with heterogeneous traffic inputs is considered. The users are carrying packets with different types of traffic (`voice/audio only', or `data only' or mixed traffic), each of which has its own distinct Quality of Service requirements. At each timeslot, a pseudo-probability is assigned to the head packet of each user, and then normalized by the packet length. The user with the maximum normalized pseudo-probability is served first and if there is power remaining in the system, the procedure is repeated with the next maximum normalized quantity, as long as power resources remain. The algorithm is compared to the `Earliest Deadline First', the best scheduling scheme in [1] for similar situations and to its modified version of PEDF in [8] and it is shown that it outperforms both.

Original languageEnglish (US)
Pages (from-to)948-954
Number of pages7
JournalIEEE Vehicular Technology Conference
Issue number52 ND
StatePublished - 2000
Event52nd Vehicular Technology Conference (IEEE VTS Fall VTC2000) - Boston, MA, USA
Duration: Sep 24 2000Sep 28 2000

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Electrical and Electronic Engineering
  • Computer Science Applications


Dive into the research topics of 'HOLPRO: A new rate scheduling algorithm for the downlink of CDMA networks'. Together they form a unique fingerprint.

Cite this