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 Transactions on Vehicular Technology

Safeguarding RSMA Networks With Cooperative Jamming and Relaying

Haoran Pang, Fei Ji, Miaowen Wen, Lexi Xu, Jian Zhao, Zhaolong Ning, Erdal Panayırcı

Published Dec 8, 2025• 2 citations
Publisher

Abstract

Cooperative rate-splitting multiple access (C-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 communications due to the open nature of the wireless channel. In this paper, we study a physical-layer security (PLS) problem for a two-user C-RSMA system 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 minimum secrecy rate (SR) for both users by the joint design of beamforming and resource allocation. To address the challenges arising from the non-convexity of the problem, we propose a sequential parametric convex approximation (SPCA)-based iterative algorithm, which entails approximating the non-convex objective and constraints by utilizing sequences of convex functions. Moreover, we study two SR maximization problems involving two different partial channel state information cases, and then resolve them by applying two novel SPCA-based iterative algorithms. Simulation results verify the effectiveness of the proposed scheme, demonstrating a significant improvement in SR compared to the schemes without jamming or relaying transmission.

DOI
10.1109/tvt.2025.3641158

Related papers

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

To secure amplify-and-forward relay systems via joint cooperative beamforming and jamming

Hui‐Ming Wang, Xiang‐Gen Xia, Qinye Yin

Securing the wireless transmissions in the physical layer is a new perspective of security. In a wireless relay system, cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, in most works these two techniques are used in phase II of the cooperative transmission, which leaves the phase I out of protection. In this paper, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously, such that both phases are secured. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.

IEEE China Summit and International Conference on Signal and Information Processing (ChinaSIP)•Jul 1, 2013•4 citations

Joint Cooperative Beamforming and Jamming to Secure AF Relay Systems With Individual Power Constraint and No Eavesdropper's CSI

Hui‐Ming Wang, Miao Luo, Xiang‐Gen Xia +1 more

Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.

IEEE Signal Processing Letters•Nov 14, 2012•194 citations

Cooperative Rate-Splitting for Secrecy Sum-Rate Enhancement in Multi-antenna Broadcast Channels

Li Ping, Ming Chen, Yijie Mao +3 more

In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and timeslot allocation are jointly optimized by solving the nonconvex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in Multi-antenna BC systems.

arXiv:2006.02555•IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Aug 1, 2020•60 citations

Two-phase cooperative jamming and beamforming for physical layer secrecy

Mohammad Hatami, Mojtaba Jahandideh, Hamid Behroozi

The broadcast nature of wireless communications makes the propagation medium vulnerable to security attacks such as eavesdropping and jamming from adversarial or unauthorized users. Applying physical layer secrecy approaches will enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, without using any secret keys. However, physical layer security approaches are typically feasible only when the source-eavesdropper channel is weaker than the source-destination channel. Cooperative jamming can be used to overcome this challenge and increase the secrecy rate. In this paper, the security of two-phase relaying system with multiple intermediate nodes and in the presence of an eavesdropper is investigated. To enhance the system secrecy rate, a joint cooperative beamforming and jamming combined with relay and jammer selections is proposed. In phase I, the source node broadcasts a signal to relays while three intermediate nodes (which act as jammers) help the source node by transmitting random jamming signals to confuse the eavesdropper. Since the friendly (cooperative) jammers create interference for both the intended relays and the eavesdropper, optimal beamforming is applied such that no interference is caused at two preselected desired relays (that are going to receive the confidential massage in phase I). In phase II, two preselected relays transmit the source message with beamforming coefficients such that the received signal at the eavesdropper is completely nulled out. Our goal in this paper is to minimize the received SNR at the eavesdropper while increasing it at the destination as much as possible by applying different methods such as cooperative beamforming, cooperative jamming and relay selection. To avoid operational complexity, we consider the minimum number of intermediate nodes that are necessary without losing the performance. Numerical results demonstrate the advantage of our proposed scheme compared with the scheme with no cooperative jamming.

Iranian Conference on Electrical Engineering•May 1, 2015•2 citations

Hybrid Opportunistic Relaying and Jamming With Power Allocation for Secure Cooperative Networks

Chao Wang, Hui‐Ming Wang, Xiang‐Gen Xia

This paper studies the cooperative transmission for securing a decode-and-forward (DF) two-hop network where multiple cooperative nodes coexist with a potential eavesdropper. Under the more practical assumption that only the channel distribution information (CDI) of the eavesdropper is known, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen among a collection of N possible candidates to forward the confidential signal and the others send jamming signals to confuse the eavesdroppers. We first investigate the ergodic secrecy rate (ESR) maximization problem by optimizing the power allocation between the confidential signal and jamming signals. In particular, we exploit the limiting distribution technique of extreme order statistics to build an asymptotic closed-form expression of the achievable ESR and the power allocation is optimized to maximize the ESR lower bound. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the Karush-Kuhn-Tucker (KKT) solutions. Furthermore, taking the time variance of the legitimate links' CSIs into consideration, we address the impacts of the outdated CSIs to the proposed secrecy scheme, and derive an asymptotic ESR. Finally, we generalize the analysis to the scenario with multiple eavesdroppers, and give the asymptotic analytical results of the achievable ESR. Simulation results confirm our analytical results.

IEEE Transactions on Wireless Communications•Sep 8, 2014•154 citations
Cooperative rate-splitting multiple access (C-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 communications due to the open nature of the wireless channel. In this paper, we study a physical-layer security (PLS) problem for a two-user C-RSMA system 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 minimum secrecy rate (SR) for both users by the joint design of beamforming and resource allocation. To address the challenges arising from the non-convexity of the problem, we propose a sequential parametric convex approximation (SPCA)-based iterative algorithm, which entails approximating the non-convex objective and constraints by utilizing sequences of convex functions. Moreover, we study two SR maximization problems involving two different partial channel state information cases, and then resolve them by applying two novel SPCA-based iterative algorithms. Simulation results verify the effectiveness of the proposed scheme, demonstrating a significant improvement in SR compared to the schemes without jamming or relaying transmission.
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.
Securing the wireless transmissions in the physical layer is a new perspective of security. In a wireless relay system, cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security in the presence of passive eavesdroppers. However, in most works these two techniques are used in phase II of the cooperative transmission, which leaves the phase I out of protection. In this paper, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously, such that both phases are secured. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.
Cooperative beamforming and jamming are two efficient schemes to improve the physical-layer security of a wireless relay system in the presence of passive eavesdroppers. However, in most works these two techniques are adopted separately. In this letter, we propose a joint cooperative beamforming and jamming scheme to enhance the security of a cooperative relay network, where a part of intermediate nodes adopt distributed beamforming while others jam the eavesdropper, simultaneously. Since the instantaneous channel state information (CSI) of the eavesdropper may not be known, we propose a cooperative artificial noise transmission based secrecy strategy, subjected to the individual power constraint of each node. The beamformer weights and power allocation can be obtained by solving a second-order convex cone programming (SOCP) together with a linear programming problem. Simulations show the joint scheme greatly improves the security.
In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and timeslot allocation are jointly optimized by solving the nonconvex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in Multi-antenna BC systems.
The broadcast nature of wireless communications makes the propagation medium vulnerable to security attacks such as eavesdropping and jamming from adversarial or unauthorized users. Applying physical layer secrecy approaches will enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, without using any secret keys. However, physical layer security approaches are typically feasible only when the source-eavesdropper channel is weaker than the source-destination channel. Cooperative jamming can be used to overcome this challenge and increase the secrecy rate. In this paper, the security of two-phase relaying system with multiple intermediate nodes and in the presence of an eavesdropper is investigated. To enhance the system secrecy rate, a joint cooperative beamforming and jamming combined with relay and jammer selections is proposed. In phase I, the source node broadcasts a signal to relays while three intermediate nodes (which act as jammers) help the source node by transmitting random jamming signals to confuse the eavesdropper. Since the friendly (cooperative) jammers create interference for both the intended relays and the eavesdropper, optimal beamforming is applied such that no interference is caused at two preselected desired relays (that are going to receive the confidential massage in phase I). In phase II, two preselected relays transmit the source message with beamforming coefficients such that the received signal at the eavesdropper is completely nulled out. Our goal in this paper is to minimize the received SNR at the eavesdropper while increasing it at the destination as much as possible by applying different methods such as cooperative beamforming, cooperative jamming and relay selection. To avoid operational complexity, we consider the minimum number of intermediate nodes that are necessary without losing the performance. Numerical results demonstrate the advantage of our proposed scheme compared with the scheme with no cooperative jamming.
This paper studies the cooperative transmission for securing a decode-and-forward (DF) two-hop network where multiple cooperative nodes coexist with a potential eavesdropper. Under the more practical assumption that only the channel distribution information (CDI) of the eavesdropper is known, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen among a collection of N possible candidates to forward the confidential signal and the others send jamming signals to confuse the eavesdroppers. We first investigate the ergodic secrecy rate (ESR) maximization problem by optimizing the power allocation between the confidential signal and jamming signals. In particular, we exploit the limiting distribution technique of extreme order statistics to build an asymptotic closed-form expression of the achievable ESR and the power allocation is optimized to maximize the ESR lower bound. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the Karush-Kuhn-Tucker (KKT) solutions. Furthermore, taking the time variance of the legitimate links' CSIs into consideration, we address the impacts of the outdated CSIs to the proposed secrecy scheme, and derive an asymptotic ESR. Finally, we generalize the analysis to the scenario with multiple eavesdroppers, and give the asymptotic analytical results of the achievable ESR. Simulation results confirm our analytical results.