TY - GEN
T1 - Outage Constrained Robust SWIPT Beamforming for Secure MIMO Broadcasting
AU - Zhu, Zhengyu
AU - Wang, Ning
AU - Chu, Zheng
AU - Wang, Zhongyong
AU - Lee, Inkyu
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/27
Y1 - 2018/7/27
N2 - Wireless energy transfer over radio frequency has been recognized as a promising alternative solution to powering the low power low complexity wireless equipments in future cellular networks. In this work, simultaneous wireless information and power transfer (SWIPT) operation for secure multi-user multipleinput multiple-output (MIMO) broadcast system is investigated with imperfect channel state information at the transmitter. The corresponding robust secure beamforming problem is studied, where the transmit power is to be minimized subject to the secrecy rate outage probability constraint for legitimate information users, and the harvested energy outage probability constraint for energy harvesting receivers. The original problem is shown to be non-convex due to the presence of the probabilistic constraints. These outage constraints are then transformed into deterministic forms by using the Bernstein-type inequalities. Based on successive convex approximation (SCA), a low-complexity approach, which reformulates the original problem as second order cone programming (SOCP), is proposed. Simulation results show that the proposed scheme outperforms the conventional method with lower complexity.
AB - Wireless energy transfer over radio frequency has been recognized as a promising alternative solution to powering the low power low complexity wireless equipments in future cellular networks. In this work, simultaneous wireless information and power transfer (SWIPT) operation for secure multi-user multipleinput multiple-output (MIMO) broadcast system is investigated with imperfect channel state information at the transmitter. The corresponding robust secure beamforming problem is studied, where the transmit power is to be minimized subject to the secrecy rate outage probability constraint for legitimate information users, and the harvested energy outage probability constraint for energy harvesting receivers. The original problem is shown to be non-convex due to the presence of the probabilistic constraints. These outage constraints are then transformed into deterministic forms by using the Bernstein-type inequalities. Based on successive convex approximation (SCA), a low-complexity approach, which reformulates the original problem as second order cone programming (SOCP), is proposed. Simulation results show that the proposed scheme outperforms the conventional method with lower complexity.
UR - http://www.scopus.com/inward/record.url?scp=85051435688&partnerID=8YFLogxK
U2 - 10.1109/ICC.2018.8422939
DO - 10.1109/ICC.2018.8422939
M3 - Conference contribution
AN - SCOPUS:85051435688
SN - 9781538631805
T3 - IEEE International Conference on Communications
BT - 2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Conference on Communications, ICC 2018
Y2 - 20 May 2018 through 24 May 2018
ER -