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 Wireless Communications

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

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

Published Sep 8, 2014• 154 citations
Publisher

Abstract

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.

DOI
10.1109/twc.2014.2354635

Related papers

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

Chao Wang, Hui‐Ming Wang

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.

IEEE International Conference on Communications workshops•Jun 1, 2014•9 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

Secure Transmission with Hybrid Relay Scheme: Relaying and Jamming

Qi Xiong, Kwok Hung Li, Ying‐Chang Liang +1 more

In this paper, secure transmission is considered in a wireless relay network in the presence of an eavesdropper. A novel hybrid relay scheme, named as relaying-and-jamming (RJ), is advocated to achieve information theoretical security. In the RJ scheme, the relay node is equipped with multiple antennas. It responses for two missions: re-transmitting the information signal from source code and broadcasting the jamming signal to degrade eavesdropper's channel. The objective of this paper is to maximize the achievable ergodic secrecy rate. We are interested in the scenario that eavesdropper's instant channel state information (CSI) is unknown, in which the ergodic secrecy rate expression is derived. The optimal power allocation between information signal and jamming signal at the relay node is found statistically to achieve the largest ergodic secrecy rate. Simulation is carefully designed and respective results are presented to confirm the theoretical analysis and compare with existing work.

UKSim European Symposium on Computer Modeling and Simulation (EMS)•Nov 1, 2013•1 citation

Secrecy Enhancement via Cooperative Relays in Multi-Hop Communication Systems

Elham Nosrati, Xianbin Wang, Arash Khabbazibasmenj +1 more

This paper proposes using cooperative relays to improve the ergodic secrecy capacity (ESC) of a multi-hop decode-and-forward (DF) relaying system where communication takes place in the presence of multiple non-colluding eavesdroppers. The proposed scheme is based on a recent approach to generate artificial noise in which transmitter of each hop allocates a portion of its power for generating an intentional interference at the eavesdroppers. Under the assumption that the transmitters can only use limited transmit power, a power allocation strategy has been developed which maximizes the secrecy capacity by optimally distributing the power between the original signal and the artificial noise. Since the optimal solution depends on the channel state information (CSI) of the eavesdroppers, which is difficult to obtain in practice, a sub-optimal solution is also presented in which the CSI of the eavesdroppers is not needed.

IEEE Vehicular Technology Conference•May 1, 2016•3 citations

Cooperative Jamming and Power Allocation for Wireless Relay Networks in Presence of Eavesdropper

Lun Dong, Homayoun Yousefi’zadeh, Hamid Jafarkhani

Relying on physical layer security is an attractive alternative of utilizing cryptographic algorithms at upper layers of protocol stack for secure communications. In this paper, we consider a two-hop wireless relay network in the presence of an eavesdropper. Our scenario of interest spans over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdropper in which the relay forwards the source message in a decode-and-forward (DF) fashion. The source and relay are allowed to use some of their available power to transmit jamming signals in order to create interference at the eavesdropper. The relay and destination are assumed to have the knowledge of the jamming signals. An important question is how to allocate the transmission power of the message signal and that of the jamming signal. First, we propose an optimal power allocation solution in which the knowledge of global channel state information (CSI) is required. To facilitate practical system design, two simple yet sub-optimal power allocation solutions are proposed which do not rely on eavesdropper's channels. For the purpose of performance comparisons, power allocation problems for two benchmark schemes without jamming are also analyzed.

International Conference on Communications•Jun 1, 2011•95 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
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.
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.
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, secure transmission is considered in a wireless relay network in the presence of an eavesdropper. A novel hybrid relay scheme, named as relaying-and-jamming (RJ), is advocated to achieve information theoretical security. In the RJ scheme, the relay node is equipped with multiple antennas. It responses for two missions: re-transmitting the information signal from source code and broadcasting the jamming signal to degrade eavesdropper's channel. The objective of this paper is to maximize the achievable ergodic secrecy rate. We are interested in the scenario that eavesdropper's instant channel state information (CSI) is unknown, in which the ergodic secrecy rate expression is derived. The optimal power allocation between information signal and jamming signal at the relay node is found statistically to achieve the largest ergodic secrecy rate. Simulation is carefully designed and respective results are presented to confirm the theoretical analysis and compare with existing work.
This paper proposes using cooperative relays to improve the ergodic secrecy capacity (ESC) of a multi-hop decode-and-forward (DF) relaying system where communication takes place in the presence of multiple non-colluding eavesdroppers. The proposed scheme is based on a recent approach to generate artificial noise in which transmitter of each hop allocates a portion of its power for generating an intentional interference at the eavesdroppers. Under the assumption that the transmitters can only use limited transmit power, a power allocation strategy has been developed which maximizes the secrecy capacity by optimally distributing the power between the original signal and the artificial noise. Since the optimal solution depends on the channel state information (CSI) of the eavesdroppers, which is difficult to obtain in practice, a sub-optimal solution is also presented in which the CSI of the eavesdroppers is not needed.
Relying on physical layer security is an attractive alternative of utilizing cryptographic algorithms at upper layers of protocol stack for secure communications. In this paper, we consider a two-hop wireless relay network in the presence of an eavesdropper. Our scenario of interest spans over a four-node network model including a source, a destination, a trusted relay, and an untrusted eavesdropper in which the relay forwards the source message in a decode-and-forward (DF) fashion. The source and relay are allowed to use some of their available power to transmit jamming signals in order to create interference at the eavesdropper. The relay and destination are assumed to have the knowledge of the jamming signals. An important question is how to allocate the transmission power of the message signal and that of the jamming signal. First, we propose an optimal power allocation solution in which the knowledge of global channel state information (CSI) is required. To facilitate practical system design, two simple yet sub-optimal power allocation solutions are proposed which do not rely on eavesdropper's channels. For the purpose of performance comparisons, power allocation problems for two benchmark schemes without jamming are also analyzed.
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.