Secrecy Sum Rate Optimization in MIMO NOMA OSTBC Systems with Imperfect Eavesdropper CSI

• Published in: Communications and Networking Vol. 262; pp. 305 - 314
• Main Authors: Yan, Jianfei, Deng, Zhishan, Chen, Qinbo
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2019; Springer International Publishing
• Series: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
• Subjects: Imperfect CSI; Multiple-input Multiple-output (MIMO); Non-orthogonal multiple access (NOMA); Orthogonal space-time block codes (OSTBC); Relay; Secrecy sum rate
• ISBN: 9783030061609; 3030061604
• ISSN: 1867-8211; 1867-822X
• DOI: 10.1007/978-3-030-06161-6_30

In this research, we investigate the secrecy sum rate optimization problem for a multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) system with orthogonal space-time block codes (OSTBC). We construct a model where the transmitter and the relay send information by employing OSTBC, while both the source and the relay have imperfect channel state information (CSI) of the eavesdropper. The precoders and the power allocation scheme are jointly designed to maximize the achievable secrecy sum rate subject to the power constraints and the minimum transmission rate requirements of the weak user. To solve this non-convex problem, we propose the constrained concave convex procedure (CCCP)-based iterative algorithm and the alternative optimization (AO) method, where the closed-form expression for power allocation is derived. The simulation results demonstrate the superiority of our proposed scheme.