Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes

Power Allocation and Admission Control in Multiuser Relay Networks via Convex Programming: Centralized and Distributed Schemes

Thumbnail Image
Download
Name

1687-1499-2009-901965.pdf

Size

825.36 KB

Format

Adobe PDF

Checksum (MD5)

5915cf45d6ca3dc9cdace47106a635e9

Author(s)
Phan, Khoa T.
•
Le, Long Bao
•
Vorobyov, Sergiy A.
•
Le-Ngoc, Tho
Date Issued
April 2009
Journal
EURASIP Journal on Wireless Communications and Networking
Publisher
Hindawi Pub. Corp.
Citation
Phan, Khoa T., 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. 2009 Apr 05;2009(1):901965
Version
Author's final manuscript
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
Persistent DSpace Link
http://hdl.handle.net/1721.1/67331
DOI of Published Version
https://doi.org/10.1155/2009/901965
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.