Research Article
Secrecy Sum Rate Optimization in MIMO NOMA OSTBC Systems with Imperfect Eavesdropper CSI
@INPROCEEDINGS{10.1007/978-3-030-06161-6_30, author={Jianfei Yan and Zhishan Deng and Qinbo Chen}, title={Secrecy Sum Rate Optimization in MIMO NOMA OSTBC Systems with Imperfect Eavesdropper CSI}, proceedings={Communications and Networking. 13th EAI International Conference, ChinaCom 2018, Chengdu, China, October 23-25, 2018, Proceedings}, proceedings_a={CHINACOM}, year={2019}, month={1}, keywords={Multiple-input Multiple-output (MIMO) Relay Non-orthogonal multiple access (NOMA) Orthogonal space-time block codes (OSTBC) Secrecy sum rate Imperfect CSI}, doi={10.1007/978-3-030-06161-6_30} }- Jianfei Yan
Zhishan Deng
Qinbo Chen
Year: 2019
Secrecy Sum Rate Optimization in MIMO NOMA OSTBC Systems with Imperfect Eavesdropper CSI
CHINACOM
Springer
DOI: 10.1007/978-3-030-06161-6_30
Abstract
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.