Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Wireless Communications Letters

Security-Reliability Tradeoff in RSMA-Based Communications Against Eavesdropper Collusion

Huiyun Xia, Xiaokang Zhou, Shuai Han, Cheng Li

Published May 25, 2023• 18 citations
Publisher

Abstract

This letter exploits secure beamforming for achieving security-reliability tradeoff in rate splitting multiple access (RSMA)-based communications against eavesdropper collusion. Considering user fairness, we maximize the minimum secrecy rate (MSR) among all legitimate users subject to the quality of service (QoS) constraints and transmit power constraint. A feasibility check problem is first presented to avoid infeasible cases. Then, a successive convex approximation-based algorithm is proposed to iteratively optimize the beamforming design. Numerical results show that the proposed RSMA-based design outperforms the baseline design in terms of MSR within certain QoS requirement ranges to trade security for reliability by balancing the power allocated to the common stream and private streams. And the performance advantage enlarges as the number of collusive eavesdroppers increases.

DOI
10.1109/lwc.2023.3279860

Related papers

Weighted Sum-Rate Maximization for Rate-Splitting Multiple Access Based Secure Communication

Huiyun Xia, Yijie Mao, Bruno Clerckx +3 more

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.

arXiv:2201.08472•IEEE Wireless Communications and Networking Conference•Apr 10, 2022•30 citations

Secrecy Outage-Constrained Robust Resource Allocation Design for MU-MISO RSMA Systems

Hao Fu, Suili Feng, Weijun Tang +2 more

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.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2021•2 citations

Resource Allocation for Secure Rate-Splitting Multiple Access with Adaptive Beamforming

Tenghao Cai, Jia Zhang, Shihao Yan +3 more

Rate splitting multiple access (RSMA) is promising to achieve high spectral efficiency with a higher flexibility relative to non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). In this paper, a novel RSMA-based secure transmission scheme with artificial noise (AN) and an adaptive beamforming is developed with the aim of maximizing the secrecy sum rate (SSR) of the considered system subject to specific constraints. The joint optimization of the power allocation between useful messages and AN signals, rate splitting between the two legitimate receivers, and the two mastering parameters of the beamforming design is tackled. To solve such a non-convex problem, we first analytically reveal some properties of the solution and then focus on an asymptotic scenario with a sufficiently large number of transmit antennas to derive closed-form expressions for the optimal power allocation coefficients. This enables us to develop an efficient method to identify the optimal rate splitting and beamforming parameters. Our examinations demonstrate that the proposed RSMA-based scheme outperforms two benchmark schemes in terms of achieving a higher SSR and the achievable performance gain is exceptional when the number of transmit antennas is small.

IEEE International Conference on Communications workshops•Jun 1, 2021•16 citations

Secure Users Oriented Downlink MISO NOMA

Hui‐Ming Wang, Xu Zhang, Qian Yang +1 more

This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.

arXiv:1903.00205•IEEE Journal of Selected Topics in Signal Processing•Feb 15, 2019•39 citations

Max-Min Fair Optimization in RSMA-Assisted Secure Communications With Artificial Noise

Huiyun Xia, Shuai Han, Cheng Li

This work investigates the role of artificial noise (AN) in security constrained rate-splitting multiple access (RSMA) communication systems. By partially decoding the multi-user interference (MUI) and partially treat it as noise, the common stream in RSMA can serve as not only useful data for legitimate users, but jamming signals to confuse the external Eves. Considering this, whether introducing additional AN is beneficial to the RSMA-based communications remains unclear. To answer this question, we take user fairness into consideration and formulate a security constrained max-min fair optimization problem. The optimal transmit beamforming design and AN vector are then obtained by applying a joint line search and semidefinite relaxation approach based alternate optimization. Numerical results show that, facing eavesdroppers with strong capabilities, introducing AN helps improve the spectral efficiency of the system while satisfying the security constraints.

IEEE Communications Letters•Oct 30, 2023•20 citations

Enhancing Security in RSMA Networks with Cooperative Jamming and Relaying

Haoran Pang, Fei Ji, Zhaolong Ning +2 more

Cooperative rate-splitting multiple access (RSMA) has emerged as a promising solution for increasing spectral efficiency over conventional RSMA. On the other hand, the presence of eavesdroppers seriously compromises secure communication due to the open nature of the wireless channel. In this paper, we study the physical-layer security (PLS) of a two-user downlink cooperative RSMA network in the presence of an eavesdropper. The cooperative jamming and relaying scheme is proposed to enhance diversity and security, where the near user opportunistically generates an artificial noise (AN) and forwards its decoded common message in two transmission phases. Our goal is to maximize the worst-case secrecy rate (SR) of both users by jointly optimizing beamforming vectors and resource allocation. To address the challenges posed by the non-convexity of the optimization problem, we propose a sequential parametric convex approximation (SPCA)-based iterative algorithm, which involves approximating the non-convex objective and constraints with a sequence of convex functions. The effectiveness of the proposed scheme is verified through the simulation results.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Sep 25, 2023•5 citations
This letter exploits secure beamforming for achieving security-reliability tradeoff in rate splitting multiple access (RSMA)-based communications against eavesdropper collusion. Considering user fairness, we maximize the minimum secrecy rate (MSR) among all legitimate users subject to the quality of service (QoS) constraints and transmit power constraint. A feasibility check problem is first presented to avoid infeasible cases. Then, a successive convex approximation-based algorithm is proposed to iteratively optimize the beamforming design. Numerical results show that the proposed RSMA-based design outperforms the baseline design in terms of MSR within certain QoS requirement ranges to trade security for reliability by balancing the power allocated to the common stream and private streams. And the performance advantage enlarges as the number of collusive eavesdroppers increases.
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.
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.
Rate splitting multiple access (RSMA) is promising to achieve high spectral efficiency with a higher flexibility relative to non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). In this paper, a novel RSMA-based secure transmission scheme with artificial noise (AN) and an adaptive beamforming is developed with the aim of maximizing the secrecy sum rate (SSR) of the considered system subject to specific constraints. The joint optimization of the power allocation between useful messages and AN signals, rate splitting between the two legitimate receivers, and the two mastering parameters of the beamforming design is tackled. To solve such a non-convex problem, we first analytically reveal some properties of the solution and then focus on an asymptotic scenario with a sufficiently large number of transmit antennas to derive closed-form expressions for the optimal power allocation coefficients. This enables us to develop an efficient method to identify the optimal rate splitting and beamforming parameters. Our examinations demonstrate that the proposed RSMA-based scheme outperforms two benchmark schemes in terms of achieving a higher SSR and the achievable performance gain is exceptional when the number of transmit antennas is small.
This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.
This work investigates the role of artificial noise (AN) in security constrained rate-splitting multiple access (RSMA) communication systems. By partially decoding the multi-user interference (MUI) and partially treat it as noise, the common stream in RSMA can serve as not only useful data for legitimate users, but jamming signals to confuse the external Eves. Considering this, whether introducing additional AN is beneficial to the RSMA-based communications remains unclear. To answer this question, we take user fairness into consideration and formulate a security constrained max-min fair optimization problem. The optimal transmit beamforming design and AN vector are then obtained by applying a joint line search and semidefinite relaxation approach based alternate optimization. Numerical results show that, facing eavesdroppers with strong capabilities, introducing AN helps improve the spectral efficiency of the system while satisfying the security constraints.
Cooperative rate-splitting multiple access (RSMA) has emerged as a promising solution for increasing spectral efficiency over conventional RSMA. On the other hand, the presence of eavesdroppers seriously compromises secure communication due to the open nature of the wireless channel. In this paper, we study the physical-layer security (PLS) of a two-user downlink cooperative RSMA network in the presence of an eavesdropper. The cooperative jamming and relaying scheme is proposed to enhance diversity and security, where the near user opportunistically generates an artificial noise (AN) and forwards its decoded common message in two transmission phases. Our goal is to maximize the worst-case secrecy rate (SR) of both users by jointly optimizing beamforming vectors and resource allocation. To address the challenges posed by the non-convexity of the optimization problem, we propose a sequential parametric convex approximation (SPCA)-based iterative algorithm, which involves approximating the non-convex objective and constraints with a sequence of convex functions. The effectiveness of the proposed scheme is verified through the simulation results.