Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes
Name
Le_Power Allocation.pdf
Size
827.5 KB
Format
Adobe PDF
Checksum (MD5)
060171ce5ab3148f2ccddba1dba0595d
Author(s)
Phan, Khoa T.
Le, Long Bao
Vorobyov, Sergiy A.
Le-Ngoc, Tho
Date Issued
March 2009
Journal
EURASIP Journal on Wireless Communications and Networking
Publisher
Hindawi Publishing
Citation
Khoa T. Phan, Long Bao Le, Sergiy A. Vorobyov, and Tho Le-Ngoc, “Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes,” EURASIP Journal on Wireless Communications and Networking, vol. 2009, Article ID 901965, 12 pages, 2009. doi:10.1155/2009/901965
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1155/2009/901965
