Beam Domain Secure Transmission for Massive MIMO Communications

• Published in: IEEE transactions on vehicular technology 2018-08, Vol.67 (8), p.7113-7127
• Main Authors: Wu, Wenqian, Gao, Xiqi, Wu, Yongpeng, Xiao, Chengshan
• Format: Article
• Language: English
• Subjects: Algorithms; Antennas; Beam domain; Codes; Computer simulation; Covariance matrices; Covariance matrix; Downlink; Eigenvectors; Iterative algorithms; Iterative methods; Lower bounds; massive MIMO; Matrix theory; MIMO communication; Network security; Optimization; physical layer security; power allocation; Power management; statistical channel state information (CSI); Tightness; Transmitting antennas
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2018.2827785

We investigate the optimality and power allocation algorithm of beam domain transmission for single-cell massive multiple-input multiple-output (MIMO) systems with a multi-antenna passive eavesdropper. Focusing on the secure massive MIMO downlink transmission with only statistical channel state information of legitimate users and the eavesdropper at base station, we introduce a lower bound on the achievable ergodic secrecy sum-rate, from which we derive the condition for eigenvectors of the optimal input covariance matrices. The result shows that beam domain transmission can achieve optimal performance in terms of secrecy sum-rate lower bound maximization. For the case of single-antenna legitimate users, we prove that it is optimal to allocate no power to the beams where the beam gains of the eavesdropper are stronger than those of legitimate users in order to maximize the secrecy sum-rate lower bound. Then, motivated by the concave-convex procedure and the large dimension random matrix theory, we develop an efficient iterative and convergent algorithm to optimize power allocation in the beam domain. Numerical simulations demonstrate the tightness of the secrecy sum-rate lower bound and the near-optimal performance of the proposed iterative algorithm.