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.
|Number of pages||14|
|Journal||IEEE/ACM Transactions on Networking|
|Publication status||Published - 2006 Feb|
Bibliographical noteFunding Information:
Manuscript received January 27, 2003; revised October 22, 2003, May 25, 2004, October 25, 2004, and December 31, 2004; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor M. Zukerman. This work was supported in part by the National Science Foundation under Grants ANI-0073359, ANI-9805441, and ANI-0207728. This research was conducted when J.-W. Lee and R. R. Mazumdar were at Purdue University.
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering