TY - GEN
T1 - Weighted Sum-Rate Maximization for Rate-Splitting Multiple Access Based Secure Communication
AU - Xia, Huiyun
AU - Mao, Yijie
AU - Clerckx, Bruno
AU - Zhou, Xiaokang
AU - Han, Shuai
AU - Li, Cheng
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - As investigations on physical layer security evolve from point-to-point systems to multi-user scenarios, multi-user interference (MUI) is introduced and becomes an unavoidable issue. Different from treating MUI totally as noise in conventional secure communications, in this paper, we propose a rate-splitting multiple access (RSMA)-based secure beamforming design, where user messages are split and encoded into common and private streams. Each user not only decodes the common stream and the intended private stream, but also tries to eavesdrop the private streams of other users. We formulate a weighted sum-rate (WSR) maximization problem subject to the secrecy rate requirements of all users. To tackle the non-convexity of the formulated problem, a successive convex approximation (SCA)-based approach is adopted to convert the original non-convex and intractable problem into a low-complexity suboptimal iterative algorithm. Numerical results demonstrate that the proposed secure beamforming scheme outperforms the conventional multi-user linear precoding (MULP) technique in terms of the WSR performance while ensuring user secrecy rate requirements.
AB - As investigations on physical layer security evolve from point-to-point systems to multi-user scenarios, multi-user interference (MUI) is introduced and becomes an unavoidable issue. Different from treating MUI totally as noise in conventional secure communications, in this paper, we propose a rate-splitting multiple access (RSMA)-based secure beamforming design, where user messages are split and encoded into common and private streams. Each user not only decodes the common stream and the intended private stream, but also tries to eavesdrop the private streams of other users. We formulate a weighted sum-rate (WSR) maximization problem subject to the secrecy rate requirements of all users. To tackle the non-convexity of the formulated problem, a successive convex approximation (SCA)-based approach is adopted to convert the original non-convex and intractable problem into a low-complexity suboptimal iterative algorithm. Numerical results demonstrate that the proposed secure beamforming scheme outperforms the conventional multi-user linear precoding (MULP) technique in terms of the WSR performance while ensuring user secrecy rate requirements.
KW - Rate-splitting multiple access (RSMA)
KW - multi-user interference (MUI)
KW - physical layer security
KW - successive convex approximation (SCA)
KW - weighted sum-rate (WSR)
UR - https://www.scopus.com/pages/publications/85130710763
U2 - 10.1109/WCNC51071.2022.9771854
DO - 10.1109/WCNC51071.2022.9771854
M3 - 会议稿件
AN - SCOPUS:85130710763
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 19
EP - 24
BT - 2022 IEEE Wireless Communications and Networking Conference, WCNC 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2022 IEEE Wireless Communications and Networking Conference, WCNC 2022
Y2 - 10 April 2022 through 13 April 2022
ER -