File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/JSTSP.2016.2612162
- Scopus: eid_2-s2.0-84996835593
- WOS: WOS:000388627900014
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Multi-Pair Two-Way Relay Network With Harvest-Then-Transmit Users: Resolving Pairwise Uplink-Downlink Coupling
Title | Multi-Pair Two-Way Relay Network With Harvest-Then-Transmit Users: Resolving Pairwise Uplink-Downlink Coupling |
---|---|
Authors | |
Keywords | Beamforming design convex optimization difference of convex program multipair two-way relay network rank relaxation wireless power transfer (WPT) |
Issue Date | 2016 |
Publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4200690 |
Citation | IEEE Journal of Selected Topics in Signal Processing, 2016, v. 10 n. 8, p. 1506-1521 How to Cite? |
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 powe r 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. |
Persistent Identifier | http://hdl.handle.net/10722/243090 |
ISSN | 2023 Impact Factor: 8.7 2023 SCImago Journal Rankings: 3.818 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | WANG, S | - |
dc.contributor.author | Xia, M | - |
dc.contributor.author | Wu, YC | - |
dc.date.accessioned | 2017-08-25T02:49:53Z | - |
dc.date.available | 2017-08-25T02:49:53Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | IEEE Journal of Selected Topics in Signal Processing, 2016, v. 10 n. 8, p. 1506-1521 | - |
dc.identifier.issn | 1932-4553 | - |
dc.identifier.uri | http://hdl.handle.net/10722/243090 | - |
dc.description.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 powe r 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. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4200690 | - |
dc.relation.ispartof | IEEE Journal of Selected Topics in Signal Processing | - |
dc.rights | ©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | Beamforming design | - |
dc.subject | convex optimization | - |
dc.subject | difference of convex program | - |
dc.subject | multipair two-way relay network | - |
dc.subject | rank relaxation | - |
dc.subject | wireless power transfer (WPT) | - |
dc.title | Multi-Pair Two-Way Relay Network With Harvest-Then-Transmit Users: Resolving Pairwise Uplink-Downlink Coupling | - |
dc.type | Article | - |
dc.identifier.email | Wu, YC: ycwu@eee.hku.hk | - |
dc.identifier.authority | Wu, YC=rp00195 | - |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1109/JSTSP.2016.2612162 | - |
dc.identifier.scopus | eid_2-s2.0-84996835593 | - |
dc.identifier.hkuros | 274727 | - |
dc.identifier.volume | 10 | - |
dc.identifier.issue | 8 | - |
dc.identifier.spage | 1506 | - |
dc.identifier.epage | 1521 | - |
dc.identifier.isi | WOS:000388627900014 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1932-4553 | - |