Downlink scheduling in CDMA data networks

Anand Bedekar*, Sem Borst, Kavita Ramanan, Phil Whiting, Edmund Yeh

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

84 Citations (Scopus)

Abstract

We identify properties of optimal scheduling schemes for downlink traffic in a Code Division Multiple Access (CDMA) data-only network. Under idealised assumptions, we show that it is optimal for each base station to transmit to at most one delay-tolerant user at a time. Moreover we prove that a base station, when on, should transmit at maximum power for optimality. For a linear network, we characterise the optimal schedule as the solution to a linear program. As a by-product, our analysis yields bounds on throughput gains obtainable from downlink scheduling.

Original languageEnglish
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Place of PublicationPiscataway, N.J.
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages2653-2657
Number of pages5
Volume5
ISBN (Print)0780357965
DOIs
Publication statusPublished - Dec 1999
Externally publishedYes
Event1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz
Duration: 5 Dec 19999 Dec 1999

Other

Other1999 IEEE Global Telecommunication Conference - GLOBECOM'99
CityRio de Janeiro, Braz
Period5/12/999/12/99

Fingerprint Dive into the research topics of 'Downlink scheduling in CDMA data networks'. Together they form a unique fingerprint.

  • Cite this

    Bedekar, A., Borst, S., Ramanan, K., Whiting, P., & Yeh, E. (1999). Downlink scheduling in CDMA data networks. In Conference Record / IEEE Global Telecommunications Conference (Vol. 5, pp. 2653-2657). [831780] Piscataway, N.J.: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/GLOCOM.1999.831780