2006
DOI: 10.1109/tnet.2005.863480
|View full text |Cite
|
Sign up to set email alerts
|

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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
89
0
16

Year Published

2006
2006
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 120 publications
(116 citation statements)
references
References 16 publications
(35 reference statements)
0
89
0
16
Order By: Relevance
“…The approximate coverage area is larger than the real coverage area to protect the primary transmission. A similar approximation of the PT coverage area can be found in [122].…”
Section: Spatial Distribution Of Ptsmentioning
confidence: 60%
“…The approximate coverage area is larger than the real coverage area to protect the primary transmission. A similar approximation of the PT coverage area can be found in [122].…”
Section: Spatial Distribution Of Ptsmentioning
confidence: 60%
“…The existing utility-based resource allocation approaches such as those presented in [8], [9], [10] and [11] only focus on maximizing the total utility of the individual BS. Such maximization can exploit multi-user diversity but it is not able to exploit multi-access-point diversity and soft-capacity which require a network-wide optimization.…”
Section: Introductionmentioning
confidence: 99%
“…A similar approach has been used in our previous works [12], [13] to formulated the power allocation problem in the downlink of a pure CDMA cellular system. Joint BS assignment and resource control for the downlink is considered in [9] and [14] as well. However, in both of these methods, separate BS assignment and resource allocation algorithms are proposed.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, it must be that r * i ≥ r * j . Denote by h 1 (x, y, r), ..., h 6 (x, y, r) the functions in the left hand side of constraints (2)-(7) and by g 1 (x, y, r),...,g 2|UX |+2|UY | (x, y, r) the functions in the left hand side of constraints (8)- (9).…”
Section: Proof Suppose There Exist Two Callsmentioning
confidence: 99%
“…the pioneering work of [7], [11] that consider the uplink, that in the early days of CDMA was considered to be the bottle-neck. For the down link, joint rate and cell assignment is studied in [9] via a dynamic pricing algorithm under the assumption that each base station maximizes its total system utility, without considering the status of the other cells. In [2] an distributed algorithm for assigning base station transmitter (BTSs) powers such that the common rate of the users is maximized is described.…”
Section: Introductionmentioning
confidence: 99%