On Artificial-Noise-Aided Transmit Design for Multiuser MISO Systems With Integrated Services

• Published in: IEEE transactions on vehicular technology Vol. 66; no. 9; pp. 8179 - 8195
• Main Authors: Mei, Weidong, Chen, Zhi, Li, Lingxiang, Fang, Jun, Li, Shaoqian
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Artificial noise (AN); Beamforming; broadcast channel; Covariance matrices; Equivalence; Maximization; MISO (control systems); Multicast; Pareto optimization; physical-layer service integration; Receivers; Robustness (mathematics); secrecy rate region; Security; Transmitters; Wireless communication
• ISSN: 0018-9545; 1939-9359
• DOI: 10.1109/TVT.2017.2676244

This paper considers artificial noise (AN) aided transmit designs for multiuser MISO systems in the eyes of service integration. Specifically, we combine two sorts of services, and serve them simultaneously: one multicast message intended for all receivers and one confidential message intended for only one receiver. The confidential message is kept perfectly secure from all the unauthorized receivers. Our goal is to jointly design the optimal input covariances for the multicast message, confidential message, and AN, such that the achievable secrecy rate region is maximized subject to the sum power constraint. This secrecy rate region maximization (SRRM) problem is a nonconvex vector maximization problem. To handle it, we reformulate the SRRM problem into a provably equivalent scalar optimization problem and propose a searching method to find all of its Pareto optimal points. The equivalent scalar optimization problem is identified as a secrecy rate maximization (SRM) problem with the quality of multicast service (QoMS) constraints. Further, we show that this equivalent QoMS-constrained SRM problem, albeit nonconvex, can be efficiently handled based on a two-stage optimization approach, including solving a sequence of semidefinite programs (SDPs). Moreover, we also extend the SRRM problem to an imperfect channel state information (CSI) case where a worst case robust formulation is considered. In particular, while transmit beamforming is generally a suboptimal technique to the SRRM problem, we prove that it is optimal for the confidential message transmission whether in the perfect CSI scenario or in the imperfect CSI scenario. For implementation efficiency, we also analyze the computational complexity of our proposed methods and put forward two suboptimal schemes and two possible extensions. Finally, numerical results demonstrate that the AN-aided transmit designs are effective in expanding the achievable secrecy rate regions, and that the suboptimal strategies can achieve near-optimal performance.