Downlink scheduling in CDMA data networks

Anand Bedekar; Sem Borst; Kavita Ramanan; Phil Whiting; Edmund Yeh

doi:10.1109/GLOCOM.1999.831780

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 proceeding › Conference proceeding contribution › peer-review

86 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 language	English
Title of host publication	Conference Record / IEEE Global Telecommunications Conference
Place of Publication	Piscataway, N.J.
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	2653-2657
Number of pages	5
Volume	5
ISBN (Print)	0780357965
DOIs	https://doi.org/10.1109/GLOCOM.1999.831780
Publication status	Published - Dec 1999
Externally published	Yes
Event	1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz Duration: 5 Dec 1999 → 9 Dec 1999

Other

Other	1999 IEEE Global Telecommunication Conference - GLOBECOM'99
City	Rio de Janeiro, Braz
Period	5/12/99 → 9/12/99

Access to Document

10.1109/GLOCOM.1999.831780

Cite this

@inproceedings{d010688c96844d82ad728d9a1f9da4fc,

title = "Downlink scheduling in CDMA data networks",

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.",

author = "Anand Bedekar and Sem Borst and Kavita Ramanan and Phil Whiting and Edmund Yeh",

year = "1999",

month = dec,

doi = "10.1109/GLOCOM.1999.831780",

language = "English",

isbn = "0780357965",

volume = "5",

pages = "2653--2657",

booktitle = "Conference Record / IEEE Global Telecommunications Conference",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "1999 IEEE Global Telecommunication Conference - GLOBECOM'99 ; Conference date: 05-12-1999 Through 09-12-1999",

}

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, 831780, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, N.J., pp. 2653-2657, 1999 IEEE Global Telecommunication Conference - GLOBECOM'99, Rio de Janeiro, Braz, 5/12/99. https://doi.org/10.1109/GLOCOM.1999.831780

Downlink scheduling in CDMA data networks. / Bedekar, Anand; Borst, Sem; Ramanan, Kavita et al.
Conference Record / IEEE Global Telecommunications Conference. Vol. 5 Piscataway, N.J.: Institute of Electrical and Electronics Engineers (IEEE), 1999. p. 2653-2657 831780.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Downlink scheduling in CDMA data networks

AU - Bedekar, Anand

AU - Borst, Sem

AU - Ramanan, Kavita

AU - Whiting, Phil

AU - Yeh, Edmund

PY - 1999/12

Y1 - 1999/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033295701&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.1999.831780

DO - 10.1109/GLOCOM.1999.831780

M3 - Conference proceeding contribution

AN - SCOPUS:0033295701

SN - 0780357965

VL - 5

SP - 2653

EP - 2657

BT - Conference Record / IEEE Global Telecommunications Conference

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, N.J.

T2 - 1999 IEEE Global Telecommunication Conference - GLOBECOM'99

Y2 - 5 December 1999 through 9 December 1999

ER -

Downlink scheduling in CDMA data networks

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this