Secrecy Throughput Maximization for IRS-aided MIMO Wireless Powered Communication Networks

• Published in: IEEE transactions on communications Vol. 70; no. 11; p. 1
• Main Authors: Shi, Weiping, Wu, Qingqing, Xiao, Fu, Shu, Feng, Wang, Jiangzhou
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.11.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Beamforming; Communication networks; Communications networks; Covariance matrix; Energy transfer; Intelligent reflecting surface; Iterative algorithms; Iterative methods; MIMO; MIMO communication; Optimization; phase shift optimization; secrecy throughput; Transmission efficiency; Wireless communications; Wireless networks; WPCN
• DOI: 10.1109/TCOMM.2022.3212734
• ISSN: 0090-6778

In this paper, we consider deploying an intelligent reflecting surface (IRS) to enhance the downlink (DL) energy transfer and uplink (UL) information transmission efficiency for secure multiple-input multiple-output (MIMO) wireless powered communication networks (WPCNs). We aim to maximize the secrecy throughput of all users by jointly optimizing the DL/UL time allocation, the energy transmit covariance matrix of hybrid access point (AP), the information transmit beamforming matrix of users and the phase shifts of IRS in DL/UL, subject to constraints of energy/information transmit power at the hybrid AP/users and that of unit-modulus IRS phase shifts for DL/UL. To tackle the non-convex problem, we first transform the original problem into an equivalent form based on the mean-square error (MSE) method given time allocation, and then apply the alternating algorithm to update the optimization variables iteratively. Specifically, the energy covariance matrix and the information beamforming matrix are obtained based on the dual subgradient method. For the IRS phase shifts, we investigate two IRS beamforming reflection setups, namely different DL/UL IRS beamforming and identical DL/UL IRS beamforming. For the former case, the second-order cone programming technique and the Majorization-Minimization algorithm/element by element iterative algorithm are applied to obtain the DL and UL IRS phase shifts, respectively. For the latter case, the IRS phase shifts are obtained by the successive convex approximation technique. To further reduce the computational complexity of the single-user system, we derive the closed-form solutions of IRS phase shifts in each iteration for the two different reflection setups. Simulation results show that all the proposed algorithms can greatly improve the secrecy throughput compared to the conventional system without IRS.