Joint resource allocation and base-station assignment for the downlink in CDMA networks

Jang-Won Lee, Ravi R. Mazumdar, Ness B. Shroff

Research output: Contribution to journalArticle

87 Citations (Scopus)

Abstract

In this paper, we jointly consider the resource allocation and base-station assignment problems for the downlink in CDMA networks that could carry heterogeneous data services. We first study a joint power and rate allocation problem that attempts to maximize the expected throughput of the system. This problem is inherently difficult because it is in fact a nonconvex optimization problem. To solve this problem, we develop a distributed algorithm based on dynamic pricing. This algorithm provides a power and rate allocation that is asymptotically optimal in the number of mobiles. We also study the effect of various factors on the development of efficient resource allocation strategies. Finally, using the outcome of the power and rate allocation algorithm, we develop a pricing-based base-station assignment algorithm that results in an overall joint resource allocation and base-station assignment. In this algorithm, a base-station is assigned to each mobile taking into account the congestion level of the base-station as well as the transmission environment of the mobile.

Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume14
Issue number1
DOIs
Publication statusPublished - 2006 Feb 1

Fingerprint

Base stations
Code division multiple access
Resource allocation
Parallel algorithms
Costs
Throughput

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

@article{a878b5e82751459cb68d66684a2377a8,
title = "Joint resource allocation and base-station assignment for the downlink in CDMA networks",
abstract = "In this paper, we jointly consider the resource allocation and base-station assignment problems for the downlink in CDMA networks that could carry heterogeneous data services. We first study a joint power and rate allocation problem that attempts to maximize the expected throughput of the system. This problem is inherently difficult because it is in fact a nonconvex optimization problem. To solve this problem, we develop a distributed algorithm based on dynamic pricing. This algorithm provides a power and rate allocation that is asymptotically optimal in the number of mobiles. We also study the effect of various factors on the development of efficient resource allocation strategies. Finally, using the outcome of the power and rate allocation algorithm, we develop a pricing-based base-station assignment algorithm that results in an overall joint resource allocation and base-station assignment. In this algorithm, a base-station is assigned to each mobile taking into account the congestion level of the base-station as well as the transmission environment of the mobile.",
author = "Jang-Won Lee and Mazumdar, {Ravi R.} and Shroff, {Ness B.}",
year = "2006",
month = "2",
day = "1",
doi = "10.1109/TNET.2005.863480",
language = "English",
volume = "14",
pages = "1--14",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

Joint resource allocation and base-station assignment for the downlink in CDMA networks. / Lee, Jang-Won; Mazumdar, Ravi R.; Shroff, Ness B.

In: IEEE/ACM Transactions on Networking, Vol. 14, No. 1, 01.02.2006, p. 1-14.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Joint resource allocation and base-station assignment for the downlink in CDMA networks

AU - Lee, Jang-Won

AU - Mazumdar, Ravi R.

AU - Shroff, Ness B.

PY - 2006/2/1

Y1 - 2006/2/1

N2 - In this paper, we jointly consider the resource allocation and base-station assignment problems for the downlink in CDMA networks that could carry heterogeneous data services. We first study a joint power and rate allocation problem that attempts to maximize the expected throughput of the system. This problem is inherently difficult because it is in fact a nonconvex optimization problem. To solve this problem, we develop a distributed algorithm based on dynamic pricing. This algorithm provides a power and rate allocation that is asymptotically optimal in the number of mobiles. We also study the effect of various factors on the development of efficient resource allocation strategies. Finally, using the outcome of the power and rate allocation algorithm, we develop a pricing-based base-station assignment algorithm that results in an overall joint resource allocation and base-station assignment. In this algorithm, a base-station is assigned to each mobile taking into account the congestion level of the base-station as well as the transmission environment of the mobile.

AB - In this paper, we jointly consider the resource allocation and base-station assignment problems for the downlink in CDMA networks that could carry heterogeneous data services. We first study a joint power and rate allocation problem that attempts to maximize the expected throughput of the system. This problem is inherently difficult because it is in fact a nonconvex optimization problem. To solve this problem, we develop a distributed algorithm based on dynamic pricing. This algorithm provides a power and rate allocation that is asymptotically optimal in the number of mobiles. We also study the effect of various factors on the development of efficient resource allocation strategies. Finally, using the outcome of the power and rate allocation algorithm, we develop a pricing-based base-station assignment algorithm that results in an overall joint resource allocation and base-station assignment. In this algorithm, a base-station is assigned to each mobile taking into account the congestion level of the base-station as well as the transmission environment of the mobile.

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

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

U2 - 10.1109/TNET.2005.863480

DO - 10.1109/TNET.2005.863480

M3 - Article

VL - 14

SP - 1

EP - 14

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 1

ER -