Secrecy Sum Rate Optimization in MIMO NOMA OSTBC Systems with Imperfect Eavesdropper CSI
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.
KeywordsMultiple-input Multiple-output (MIMO) Relay Non-orthogonal multiple access (NOMA) Orthogonal space-time block codes (OSTBC) Secrecy sum rate Imperfect CSI
This work was supported in part by the National Natural Science Foundation of China (No. 61672549, No. 61472458).
- 3.Kader, M.F., Shin, S.Y.: Cooperative spectrum sharing with space time block coding and non-orthogonal multiple access. In: ICUFN 2016, pp. 490–494 (2016)Google Scholar
- 5.Hjorugnes, A., Gesbert, D.: Precoding of orthogonal-space time block codes in arbitrarily correlated MIMO channels: iterative and closed-form solutions. IEEE Trans. Wirel. Commun. 6(3), 1072–1082 (2007)Google Scholar
- 6.Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)Google Scholar