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 International Conference on Communications workshops

Joint relay selection and artificial jamming power allocation for secure DF relay networks

Chao Wang, Hui‐Ming Wang

Published Jun 1, 2014• 9 citations
Publisher

Abstract

This paper studies cooperative transmission for securing a decode-and-forward (DF) two-hop network where massive cooperative nodes coexist with a potential single eavesdropper. With only the statistical channel state information (CSIs) of the eavesdroppers, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen to forward the confidential signal and the others act as jammers to send the jamming signals to confuse the eavesdropper. Utilizing the limiting distribution technique of extreme order statistics, we optimize the power allocation between the confidential information and jamming signal based on the statistical CSIs of the legitimate nodes for ergodic secrecy rate (ESR) maximization. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the KKT solutions. Then, we derive an analytical closed-form expression of the achievable ESR, which reduces the complexity of the system analysis and design.

DOI
10.1109/iccw.2014.6881301

Related papers

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

Power-Constrained Secrecy Rate Maximization for Joint Relay and Jammer Selection Assisted Wireless Networks

Haiyan Guo, Zhen Yang, Linghua Zhang +2 more

In this paper, we examine the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward protocol is considered. We propose a new joint relay and jammer selection (JRJS) scheme for protecting wireless communications against eavesdropping, where an intermediate node is selected as the relay for the sake of forwarding the source signal to the destination and meanwhile, the remaining intermediate nodes are employed to act as friendly jammers, which broadcast the artificial noise for disturbing the eavesdropper. We further investigate the power allocation among the source, relay and friendly jammers for maximizing the secrecy rate of proposed JRJS scheme, and derive a closed-form sub-optimal solution. Specifically, all the intermediate nodes, which successfully decode the source signal, are considered as relay candidates. For each candidate, we derive the sub-optimal closed-form power allocation solution and obtain the secrecy rate result of the corresponding JRJS scheme. Then, the candidate, which is capable of achieving the highest secrecy rate, is selected as the relay. Two assumptions about the channel state information (CSI), namely the full CSI (FCSI) and partial CSI (PCSI), are considered. Simulation results show that the proposed JRJS scheme outperforms the conventional pure relay selection, pure jamming, and generalized singular-value-decomposition-based beamforming schemes in terms of secrecy rate. Additionally, the proposed FCSI-based power allocation and PCSI-based power allocation schemes both achieve higher secrecy rates than the equal power allocation scheme.

arXiv:1701.01820•IEEE Transactions on Communications•Jan 10, 2017•45 citations

Robust beamforming and cooperative jamming for secure transmission in DF relay systems

Bin Li, Zesong Fei

In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.

EURASIP Journal on Wireless Communications and Networking•Mar 1, 2016•11 citations

Optimal Relay Selection for Physical Layer Security with Cooperative Jamming

Lijun Jia

This paper studies a scheme of optimal relay selection with cooperative jamming and optimal power allocation factor between forwarding relay and jammer.The traditional optimal relay selection scheme selects an optimal relay node to assist forward source information.Based on legitimate user and eavesdropper instantaneous channel state information, the proposed scheme selects two relay nodes to increase security against eavesdropper.The first relays to forward source information as traditional scheme.The second relays to send artificial noise as a friendly jammer.The relay operates in Decode-and-Forward strategy.The closed form expression of secrecy outage probability is derived.In addition, the optimal power allocation factor is given when the total relay transmit power is constrained.The simulation results verify that the proposed scheme can significantly improve system security performance compared with the traditional scheme.,

International Conference on Innovative Development of E-commerce and Logistics (ICIDEL)•Jan 1, 2018•0 citations

Cooperative Jamming for Secure Communications in MIMO Relay Networks

Jing Huang, Arnold Lee Swindlehurst

Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.

arXiv:1107.1544•IEEE Transactions on Signal Processing•Jul 7, 2011•347 citations

Optimal power allocation for joint cooperative beamforming and jamming assisted wireless networks

Haiyan Guo, Zhen Yang, Linghua Zhang +2 more

In this paper, we examine the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward (DF) protocol is considered. We propose a new joint cooperative beamforming and jamming (JCBJ) scheme to protect wireless communication against eavesdropping, where the intermediate nodes which successfully decode the source signal are selected as the relays for simultaneously forwarding the source signal by employing a weight vector, and meanwhile, the others are used to act as the friendly jammers for broadcasting artificial noise to disturb the eavesdropper. We further investigate the optimal power allocation among the source, relays and friendly jammers for maximizing the secrecy rate of the proposed JCBJ scheme and derive a closed-form sub-optimal solution. Simulation results show that the proposed JCBJ scheme achieves obviously higher secrecy rate than the conventional generalized singular-value-decomposition (GSVD) based beamforming and pure jamming schemes. Additionally, the proposed optimal power allocation scheme performs much better than the equal power allocation scheme in terms of secrecy rate.

International Conference on Communications•May 1, 2017•5 citations
This paper studies cooperative transmission for securing a decode-and-forward (DF) two-hop network where massive cooperative nodes coexist with a potential single eavesdropper. With only the statistical channel state information (CSIs) of the eavesdroppers, we propose an opportunistic relaying with artificial jamming secrecy scheme, where a “best” cooperative node is chosen to forward the confidential signal and the others act as jammers to send the jamming signals to confuse the eavesdropper. Utilizing the limiting distribution technique of extreme order statistics, we optimize the power allocation between the confidential information and jamming signal based on the statistical CSIs of the legitimate nodes for ergodic secrecy rate (ESR) maximization. Although the optimization problems are non-convex, we propose a sequential parametric convex approximation (SPCA) algorithm to locate the KKT solutions. Then, we derive an analytical closed-form expression of the achievable ESR, which reduces the complexity of the system analysis and design.
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.
In this paper, we examine the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward protocol is considered. We propose a new joint relay and jammer selection (JRJS) scheme for protecting wireless communications against eavesdropping, where an intermediate node is selected as the relay for the sake of forwarding the source signal to the destination and meanwhile, the remaining intermediate nodes are employed to act as friendly jammers, which broadcast the artificial noise for disturbing the eavesdropper. We further investigate the power allocation among the source, relay and friendly jammers for maximizing the secrecy rate of proposed JRJS scheme, and derive a closed-form sub-optimal solution. Specifically, all the intermediate nodes, which successfully decode the source signal, are considered as relay candidates. For each candidate, we derive the sub-optimal closed-form power allocation solution and obtain the secrecy rate result of the corresponding JRJS scheme. Then, the candidate, which is capable of achieving the highest secrecy rate, is selected as the relay. Two assumptions about the channel state information (CSI), namely the full CSI (FCSI) and partial CSI (PCSI), are considered. Simulation results show that the proposed JRJS scheme outperforms the conventional pure relay selection, pure jamming, and generalized singular-value-decomposition-based beamforming schemes in terms of secrecy rate. Additionally, the proposed FCSI-based power allocation and PCSI-based power allocation schemes both achieve higher secrecy rates than the equal power allocation scheme.
In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.
This paper studies a scheme of optimal relay selection with cooperative jamming and optimal power allocation factor between forwarding relay and jammer.The traditional optimal relay selection scheme selects an optimal relay node to assist forward source information.Based on legitimate user and eavesdropper instantaneous channel state information, the proposed scheme selects two relay nodes to increase security against eavesdropper.The first relays to forward source information as traditional scheme.The second relays to send artificial noise as a friendly jammer.The relay operates in Decode-and-Forward strategy.The closed form expression of secrecy outage probability is derived.In addition, the optimal power allocation factor is given when the total relay transmit power is constrained.The simulation results verify that the proposed scheme can significantly improve system security performance compared with the traditional scheme.,
Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.
In this paper, we examine the physical layer security for cooperative wireless networks with multiple intermediate nodes, where the decode-and-forward (DF) protocol is considered. We propose a new joint cooperative beamforming and jamming (JCBJ) scheme to protect wireless communication against eavesdropping, where the intermediate nodes which successfully decode the source signal are selected as the relays for simultaneously forwarding the source signal by employing a weight vector, and meanwhile, the others are used to act as the friendly jammers for broadcasting artificial noise to disturb the eavesdropper. We further investigate the optimal power allocation among the source, relays and friendly jammers for maximizing the secrecy rate of the proposed JCBJ scheme and derive a closed-form sub-optimal solution. Simulation results show that the proposed JCBJ scheme achieves obviously higher secrecy rate than the conventional generalized singular-value-decomposition (GSVD) based beamforming and pure jamming schemes. Additionally, the proposed optimal power allocation scheme performs much better than the equal power allocation scheme in terms of secrecy rate.