Multi-Pair Two-Way Relay Network with Harvest-Then-Transmit Users: Resolving Pairwise Uplink-Downlink Coupling release_gvkr2ps7hvbk5cvcyv2hpwlczi

by Shuai Wang, Minghua Xia, Yik-Chung Wu

Released as a article .

2016  

Abstract

While two-way relaying is a promising way to enhance the spectral efficiency of wireless networks, the imbalance of relay-user distances may lead to excessive wireless power at the nearby-users. To exploit the excessive power, the recently proposed harvest-then-transmit technique can be applied. However, it is well-known that harvest-then-transmit introduces uplink-downlink coupling for a user. Together with the co-dependent relationship between paired users and interference among multiple user pairs, wirelessly powered two-way relay network suffers from the unique pairwise uplink-downlink coupling, and the joint uplink-downlink network design is nontrivial. To this end, for the one pair users case, we show that a global optimal solution can be obtained. For the general case of multi-pair users, based on the rank-constrained difference of convex program, a convergence guaranteed iterative algorithm with an efficient initialization is proposed. Furthermore, a lower bound to the performance of the optimal solution is derived by introducing virtual receivers at relay. Numerical results on total transmit power show that the proposed algorithm achieves a transmit power value close to the lower bound.
In text/plain format

Archived Files and Locations

application/pdf  406.9 kB
file_6xszflw5kbapvitysa4osmx7kq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-09-08
Version   v2
Language   en ?
arXiv  1608.06405v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: dd03b0fa-05bd-427b-9525-d22d1dace79e
API URL: JSON