Secrecy Throughput Maximization for Massive MIMO Wireless Powered Communication Networks

• Published in: IEEE Global Communications Conference (Online) pp. 1 - 6
• Main Authors: Rezaei, Roohollah, Sun, Sumei, Kang, Xin, Guan, Yong Liang, Pakravan, Mohammad Reza
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2019
• Subjects: Erbium; MIMO communication; Receiving antennas; Throughput; Transmitting antennas; Wireless communication
• ISSN: 2576-6813
• DOI: 10.1109/GLOBECOM38437.2019.9013995

In this paper, we study the secrecy throughput in a massive Multiple-Input-Multiple-Output (MIMO) full-duplex wireless powered communication network (WPCN). The network consists of a massive MIMO base station (BS) and two groups of single- antenna sensor nodes which harvest energy from the BS. The first group, referred to as information transmitters (ITs), use the harvested energy to transmit information back to the BS; the second group, referred to as energy receivers (ERs), use the harvested energy for non- transmission related operations. We consider a two-slot protocol. In the first time slot, all nodes harvest energy from the BS. In the second slot, ITs transmit information to the BS, while BS use one set of its antennas to receive the signals and the other set of antennas to transmit artificial noise (AN) to the ERs. The AN serves two purposes: wireless power transfer to the ERs, and information security for the ITs with ERs, which are considered as potential eavesdroppers. We aim to maximize the total secrecy throughput of ITs subject to the ERs’ received energy constraints. The problem is shown to be non- convex. To tackle the problem, we propose a two- stage suboptimal approach, referred to as Maximizing Received AN aided Secrecy Throughput Maximization (MRAN- STM). In the first stage, the transmitted AN is optimized to maximize the minimum received AN of all the ERs. Then, in the second stage, the power allocation and time slot duration are optimized to maximize the total secrecy throughput. Numerical results show the improvement of the proposed algorithm.