TY - GEN
T1 - Secrecy Outage-Constrained Robust Resource Allocation Design for MU-MISO RSMA Systems
AU - Fu, Hao
AU - Feng, Suili
AU - Tang, Weijun
AU - Wei, Zhiqiang
AU - Kwan Ng, Derrick Wing
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - In this paper, we study the robust and fair transmission design for a rate splitting multiple access (RSMA)-based multi-user multiple-input single-output (MU-MISO) probabilistic secrecy communication system, where the statistic distribution of estimation errors of eavesdropping channels is available at the transmitter. Our robust resource allocation design aims to maximize the minimum achievable outage constrained (OC) secrecy rate among multiple single-antenna legitimated users (LUs) via optimizing the beamforming vectors and the artificial noise (AN) matrix at the transmitter. To this end, the algorithm design is formulated as a non-convex probabilistic optimization problem which takes into account the maximum transmit power budget. To address the intractability of the optimization problem, the successive convex approximation (SCA) technique and the alternating optimization (AO) approach are exploited to design a suboptimal iterative algorithm for obtaining a locally optimal solution of the considered problem. Simulation results demonstrate that the minimum achievable OC secrecy rate performance of our proposed RSMA-based probabilistic secure transmission system outperforms that of several baseline schemes.
AB - In this paper, we study the robust and fair transmission design for a rate splitting multiple access (RSMA)-based multi-user multiple-input single-output (MU-MISO) probabilistic secrecy communication system, where the statistic distribution of estimation errors of eavesdropping channels is available at the transmitter. Our robust resource allocation design aims to maximize the minimum achievable outage constrained (OC) secrecy rate among multiple single-antenna legitimated users (LUs) via optimizing the beamforming vectors and the artificial noise (AN) matrix at the transmitter. To this end, the algorithm design is formulated as a non-convex probabilistic optimization problem which takes into account the maximum transmit power budget. To address the intractability of the optimization problem, the successive convex approximation (SCA) technique and the alternating optimization (AO) approach are exploited to design a suboptimal iterative algorithm for obtaining a locally optimal solution of the considered problem. Simulation results demonstrate that the minimum achievable OC secrecy rate performance of our proposed RSMA-based probabilistic secure transmission system outperforms that of several baseline schemes.
UR - https://www.scopus.com/pages/publications/85126101436
U2 - 10.1109/GCWkshps52748.2021.9682157
DO - 10.1109/GCWkshps52748.2021.9682157
M3 - 会议稿件
AN - SCOPUS:85126101436
T3 - 2021 IEEE Globecom Workshops, GC Wkshps 2021 - Proceedings
BT - 2021 IEEE Globecom Workshops, GC Wkshps 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE Globecom Workshops, GLOBECOM Workshop 2021
Y2 - 7 December 2021 through 11 December 2021
ER -