TY - JOUR
T1 - Beamforming and Power Splitting Designs for AN-Aided Secure Multi-User MIMO SWIPT Systems
AU - Zhu, Zhengyu
AU - Chu, Zheng
AU - Wang, Ning
AU - Huang, Sai
AU - Wang, Zhongyong
AU - Lee, Inkyu
N1 - Funding Information:
This work was supported in part by the China National 863 Project under Grant 2014AA01A705, in part by the National Natural Science Foundation of China under Grant 61401402, Grant 61571402, Grant 61571401, Grant 61640003, Grant 61401401, Grant 61501404, and Grant 61601516), in part by the Open Research Fund of National Mobile Communications Research Laboratory, Southeast University, under Grant 2015D04, in part by the Specialized Research Fund for the Doctoral Program of Higher Education under Grant 20134101120001, in part by the Outstanding Young Talent Research Fund of Zhengzhou University under Grant 1521318003, in part by the China Postdoctoral Science Foundation under Grant 2015T80779, and in part by the National Research Foundation (NRF) funded by the Ministry of Science, ICT & Future Planning (MSIP) of Korea Government under Grant 2014R1A2A1A10049769 and 2017R1A2B3012316. The work of Z. Chu was supported by the Newton Fund/British Council Institutional Links under Grant ID 216429427, Project code 101977.
Publisher Copyright:
© 2005-2012 IEEE.
PY - 2017/12
Y1 - 2017/12
N2 - In this paper, an energy harvesting scheme for a multi-user multiple-input-multiple-output secrecy channel with artificial noise (AN) transmission is investigated. Joint optimization of the transmit beamforming matrix, the AN covariance matrix, and the power splitting ratio is conducted to minimize the transmit power under the target secrecy rate, the total transmit power, and the harvested energy constraints. The original problem is shown to be non-convex, which is tackled by a two-layer decomposition approach. The inner layer problem is solved through semi-definite relaxation, and the outer problem, on the other hand, is shown to be a single-variable optimization that can be solved by 1-D line search. To reduce computational complexity, a sequential parametric convex approximation method is proposed to find a near-optimal solution. This paper is then extended to the imperfect channel state information case with norm-bounded channel errors. Furthermore, tightness of the relaxation for the proposed schemes is validated by showing that the optimal solution of the relaxed problem is rank-one. Simulation results demonstrate that the proposed SPCA method achieves the same performance as the scheme based on 1-D but with much lower complexity.
AB - In this paper, an energy harvesting scheme for a multi-user multiple-input-multiple-output secrecy channel with artificial noise (AN) transmission is investigated. Joint optimization of the transmit beamforming matrix, the AN covariance matrix, and the power splitting ratio is conducted to minimize the transmit power under the target secrecy rate, the total transmit power, and the harvested energy constraints. The original problem is shown to be non-convex, which is tackled by a two-layer decomposition approach. The inner layer problem is solved through semi-definite relaxation, and the outer problem, on the other hand, is shown to be a single-variable optimization that can be solved by 1-D line search. To reduce computational complexity, a sequential parametric convex approximation method is proposed to find a near-optimal solution. This paper is then extended to the imperfect channel state information case with norm-bounded channel errors. Furthermore, tightness of the relaxation for the proposed schemes is validated by showing that the optimal solution of the relaxed problem is rank-one. Simulation results demonstrate that the proposed SPCA method achieves the same performance as the scheme based on 1-D but with much lower complexity.
KW - Multi-user MIMO
KW - artificial noise
KW - physical layer security
KW - power splitting
KW - simultaneous wireless information and power transfer
UR - http://www.scopus.com/inward/record.url?scp=85023758231&partnerID=8YFLogxK
U2 - 10.1109/TIFS.2017.2721908
DO - 10.1109/TIFS.2017.2721908
M3 - Article
AN - SCOPUS:85023758231
VL - 12
SP - 2861
EP - 2874
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
SN - 1556-6013
IS - 12
M1 - 7962221
ER -