Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes
The power allocation problem for multiuser wireless networks is considered under the assumption of amplify-and-forward cooperative diversity. Specifically, optimal centralized and distributed power allocation strategies with and without minimum rate requirements are proposed. We make the followi...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Hindawi Publishing
2009
|
| Online Access: | http://hdl.handle.net/1721.1/50242 https://orcid.org/0000-0003-3577-6530 |
| Summary: | The power allocation problem for multiuser wireless
networks is considered under the assumption of amplify-and-forward
cooperative diversity. Specifically, optimal centralized
and distributed power allocation strategies with and without
minimum rate requirements are proposed. We make the following
contributions. First, power allocation strategies are developed to
maximize either (i) the minimum rate among all users or (ii)
the weighted-sum of rates. These two strategies achieve different
throughput and fairness tradeoffs which can be chosen by
network operators depending on their offering services. Second,
the distributed implementation of the weighted-sum of rates
maximization-based power allocation is proposed. Third, we
consider the case when the requesting users have minimum rate
requirements, which may not be all satisfied due to the limited-power relays. Consequently, admission control is needed to select
the number of users for further optimal power allocation. As such
a joint optimal admission control and power allocation problem
is combinatorially hard, a heuristic-based suboptimal algorithm
with significantly reduced complexity and remarkably good
performance is developed. Numerical results demonstrate the
effectiveness of the proposed approaches and reveal interesting
throughput-fairness tradeoff in resource allocation. |
|---|