Joint scheduling and resource allocation in CDMA systems

Vijay G. Subramanian; Randall A. Berry; Rajeev Agrawal

doi:10.1109/TIT.2010.2040860

Joint scheduling and resource allocation in CDMA systems

Vijay G. Subramanian, Randall A. Berry, Rajeev Agrawal

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

33 Scopus citations

Abstract

In this paper, the scheduling and resource allocation problem for the downlink in a code-division multiple access (CDMA)-based wireless network is considered. The problem is to select a subset of the users for transmission and for each of the users selected, to choose the modulation and coding scheme, transmission power, and number of codes used. We refer to this combination as the physical layer operating point (PLOP). Each PLOP consumes different amounts of code and power resources. The resource allocation task is to pick the optimal PLOP taking into account both system-wide and individual user resource constraints that can arise in a practical system. This problem is tackled as part of a utility maximization problem framed in earlier papers that includes both scheduling and resource allocation. In this setting, the problem reduces to maximizing the weighted throughput over the state-dependent downlink capacity region while taking into account the system-wide and individual user constraints. This problem is studied for the downlink of a Gaussian broadcast channel with orthogonal CDMA transmissions. This results in a tractable convex optimization problem. A dual formulation is used to obtain several key structural properties. By exploiting this structure, algorithms are developed to find the optimal solution with geometric convergence.

Original language	English (US)
Article number	26
Pages (from-to)	2416-2432
Number of pages	17
Journal	IEEE Transactions on Information Theory
Volume	56
Issue number	5
DOIs	https://doi.org/10.1109/TIT.2010.2040860
State	Published - May 2010

Funding

Manuscript received May 07, 2004; revised June 26, 2009. Current version published April 21, 2010. The majority of this work was done while V. G. Sub-ramanian was with the Mathematics of Communication Networks Group, Mo-torola Inc. The work of V. G. Subramanian was supported in part by SFI under Grants IN3/03/I346 and 07/IN.1/I901. The work of R. A. Berry was supported in part by the Northwestern-Motorola Center for Communications and the NSF CAREER Award CCR-0238382. The material in this paper was presented in part at the Second Workshop on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Cambridge, U.K., March 2004.

Keywords

Cellular network
Channel-aware scheduling
Code-division multiple access (CDMA)
Convex optimization
Resource allocation
Utility maximization

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2010.2040860

Cite this

@article{e113d32cdc3d499aa6573a0d8032e1a8,

title = "Joint scheduling and resource allocation in CDMA systems",

abstract = "In this paper, the scheduling and resource allocation problem for the downlink in a code-division multiple access (CDMA)-based wireless network is considered. The problem is to select a subset of the users for transmission and for each of the users selected, to choose the modulation and coding scheme, transmission power, and number of codes used. We refer to this combination as the physical layer operating point (PLOP). Each PLOP consumes different amounts of code and power resources. The resource allocation task is to pick the optimal PLOP taking into account both system-wide and individual user resource constraints that can arise in a practical system. This problem is tackled as part of a utility maximization problem framed in earlier papers that includes both scheduling and resource allocation. In this setting, the problem reduces to maximizing the weighted throughput over the state-dependent downlink capacity region while taking into account the system-wide and individual user constraints. This problem is studied for the downlink of a Gaussian broadcast channel with orthogonal CDMA transmissions. This results in a tractable convex optimization problem. A dual formulation is used to obtain several key structural properties. By exploiting this structure, algorithms are developed to find the optimal solution with geometric convergence.",

keywords = "Cellular network, Channel-aware scheduling, Code-division multiple access (CDMA), Convex optimization, Resource allocation, Utility maximization",

author = "Subramanian, {Vijay G.} and Berry, {Randall A.} and Rajeev Agrawal",

note = "Funding Information: Manuscript received May 07, 2004; revised June 26, 2009. Current version published April 21, 2010. The majority of this work was done while V. G. Sub-ramanian was with the Mathematics of Communication Networks Group, Mo-torola Inc. The work of V. G. Subramanian was supported in part by SFI under Grants IN3/03/I346 and 07/IN.1/I901. The work of R. A. Berry was supported in part by the Northwestern-Motorola Center for Communications and the NSF CAREER Award CCR-0238382. The material in this paper was presented in part at the Second Workshop on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Cambridge, U.K., March 2004.",

year = "2010",

month = may,

doi = "10.1109/TIT.2010.2040860",

language = "English (US)",

volume = "56",

pages = "2416--2432",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Joint scheduling and resource allocation in CDMA systems

AU - Subramanian, Vijay G.

AU - Berry, Randall A.

AU - Agrawal, Rajeev

N1 - Funding Information: Manuscript received May 07, 2004; revised June 26, 2009. Current version published April 21, 2010. The majority of this work was done while V. G. Sub-ramanian was with the Mathematics of Communication Networks Group, Mo-torola Inc. The work of V. G. Subramanian was supported in part by SFI under Grants IN3/03/I346 and 07/IN.1/I901. The work of R. A. Berry was supported in part by the Northwestern-Motorola Center for Communications and the NSF CAREER Award CCR-0238382. The material in this paper was presented in part at the Second Workshop on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Cambridge, U.K., March 2004.

PY - 2010/5

Y1 - 2010/5

N2 - In this paper, the scheduling and resource allocation problem for the downlink in a code-division multiple access (CDMA)-based wireless network is considered. The problem is to select a subset of the users for transmission and for each of the users selected, to choose the modulation and coding scheme, transmission power, and number of codes used. We refer to this combination as the physical layer operating point (PLOP). Each PLOP consumes different amounts of code and power resources. The resource allocation task is to pick the optimal PLOP taking into account both system-wide and individual user resource constraints that can arise in a practical system. This problem is tackled as part of a utility maximization problem framed in earlier papers that includes both scheduling and resource allocation. In this setting, the problem reduces to maximizing the weighted throughput over the state-dependent downlink capacity region while taking into account the system-wide and individual user constraints. This problem is studied for the downlink of a Gaussian broadcast channel with orthogonal CDMA transmissions. This results in a tractable convex optimization problem. A dual formulation is used to obtain several key structural properties. By exploiting this structure, algorithms are developed to find the optimal solution with geometric convergence.

AB - In this paper, the scheduling and resource allocation problem for the downlink in a code-division multiple access (CDMA)-based wireless network is considered. The problem is to select a subset of the users for transmission and for each of the users selected, to choose the modulation and coding scheme, transmission power, and number of codes used. We refer to this combination as the physical layer operating point (PLOP). Each PLOP consumes different amounts of code and power resources. The resource allocation task is to pick the optimal PLOP taking into account both system-wide and individual user resource constraints that can arise in a practical system. This problem is tackled as part of a utility maximization problem framed in earlier papers that includes both scheduling and resource allocation. In this setting, the problem reduces to maximizing the weighted throughput over the state-dependent downlink capacity region while taking into account the system-wide and individual user constraints. This problem is studied for the downlink of a Gaussian broadcast channel with orthogonal CDMA transmissions. This results in a tractable convex optimization problem. A dual formulation is used to obtain several key structural properties. By exploiting this structure, algorithms are developed to find the optimal solution with geometric convergence.

KW - Cellular network

KW - Channel-aware scheduling

KW - Code-division multiple access (CDMA)

KW - Convex optimization

KW - Resource allocation

KW - Utility maximization

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

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

U2 - 10.1109/TIT.2010.2040860

DO - 10.1109/TIT.2010.2040860

M3 - Article

AN - SCOPUS:77951562616

SN - 0018-9448

VL - 56

SP - 2416

EP - 2432

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

M1 - 26

ER -

Joint scheduling and resource allocation in CDMA systems

Abstract

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this