Joint Power Allocation and Beamforming for Energy-Efficient Two-Way Multi-Relay Communications
Author(s): Sheng, Zhichao; Tuan, Hoang Duong; Duong, Trung Q; Poor, H Vincent
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr16t0gw59
Abstract: | This paper considers the joint design of user power allocation and relay beamforming in relaying communications, in which multiple pairs of single-antenna users exchange information with each other via multiple-antenna relays in two time slots. All users transmit their signals to the relays in the first time slot while the relays broadcast the beamformed signals to all users in the second time slot. The aim is to maximize the system's energy efficiency (EE) subject to quality-of-service (QoS) constraints in terms of exchange throughput requirements. The QoS constraints are nonconvex with many nonlinear cross-terms, so finding a feasible point is already computationally challenging. The sum throughput appears in the numerator while the total consumption power appears in the denominator of the EE objective function. The former is a nonconcave function and the latter is a nonconvex function, making fractional programming useless for EE optimization. Nevertheless, efficient iterations of low complexity to obtain its optimized solutions are developed. The performance of the multiple-user and multiple-relay networks under various scenarios is evaluated to show the merit of the proposed method. |
Publication Date: | 21-Jul-2017 |
Citation: | Sheng, Zhichao, Tuan, Hoang Duong, Duong, Trung Q, Poor, H Vincent. (2017). Joint Power Allocation and Beamforming for Energy-Efficient Two-Way Multi-Relay Communications. IEEE Transactions on Wireless Communications, 16 (10), 6660 - 6671. doi:10.1109/twc.2017.2728059 |
DOI: | doi:10.1109/twc.2017.2728059 |
ISSN: | 1536-1276 |
Pages: | 6660 - 6671 |
Type of Material: | Journal Article |
Journal/Proceeding Title: | IEEE Transactions on Wireless Communications |
Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.