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

IET Communications

Performance analysis of secure AF relay networks using cooperative jamming under outdated CSI

Asma Mabrouk, Kamel Tourki, Mazen O. Hasna, Noureddine Hamdi

Published Jul 24, 2017• 10 citations
Publisher

Abstract

This paper studies cooperative transmission for securing a two‐hop network where the eavesdropper can wiretap the relay channels. With outdated channel state information (CSI), we propose an opportunistic relaying with destination‐based jamming scheme, where one relay is chosen to forward the confidential signal and the destination sends jamming signal to confuse the eavesdropper. To reveal the capability of the proposed scheme in improving the system secrecy, we investigate the two common performance metrics under different assumptions on the eavesdropper CSI. First, lower bound on the ergodic secrecy capacity (ESC) is derived assuming perfect knowledge of the eavesdropper channel gains. We, then, extend our results to the scenario where only the legitimate channel gain is known. Here, lower bound on the secrecy outage probability (SOP) is obtained. To further improve the utility of the destination, under total power constraint, a power allocation between data signal and jamming noise is considered. Both the analysis and simulation results indicate that the system performance is significantly improved in terms of both ESC and SOP when the jamming power at the destination is adjusted according to the selected relay position. We verify that, with outdated CSI, the secrecy performance of opportunistic relaying is severely degraded.

DOI
10.1049/iet-com.2017.0412

Related papers

Impact of outdated CSI on the secrecy performance of dual-hop networks using cooperative jamming

Walid Mallat, Wided Hadj Alouane, Hatem Boujemâa +1 more

This paper studies the problem of secure dual-hop AF network in the presence of eavesdropper. We study the secrecy performance of partial relay selection with outdated channel state information (CSI). We propose a system secrecy where two sources and destination simultaneously transmit the legitimate and the jamming signal respectively. The selected relay forwards the combined signal to the legitimate receiver and the eavesdropper. We derive a closed-form expression for lower bound on the ergodic secrecy capacity (ESC) under different assumptions of the eavesdropper channel gains. We verify that the system performance is degraded as the correlation coefficient decreases. Simulation results are considered to verify the exactness of the proposed mathematical analysis.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jun 1, 2019•3 citations

Secure cooperative untrusted-relay network with outdated CSI

Asma Mabrouk, Kamel Tourki, Noureddine Hamdi

This paper studies the secrecy performance of an untrusted amplify-and-forward relaying network where both the relaying and the direct links are used to convey the source's information. Since relays act as eavesdroppers, a source-based jamming technique is proposed to keep the source's message secret from these helper nodes. We analyze the secrecy capacity of partial relay selection based on outdated channel state information. The study is conducted analytically by deriving the lower-bound expression for the ergodic secrecy capacity (ESC). We demonstrate through the simulation results the tightness of the derived bound. The use of the direct link is shown to improve the secrecy performance of the proposed scheme. In this case, we found that ESC performance with maximum ratio combining at the destination is better than that with selection combining. The system performance worsens as the correlation coefficient decreases. Furthermore, the maximum of ESC is achieved when relays are in the middle between the source and the destination with equal power allocation between the information and the jamming signals at the source.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Sep 1, 2016•8 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

Transmission mode selection scheme for physical layer security in multi-user multi-relay systems

Asma Mabrouk, Kamel Tourki, Noureddine Hamdi

We study a relay and user selection scheme to improve the secrecy performance of cooperative multi-user multiple amplify-and-forward (AF) relay network. Nevertheless, relay transmission is highly susceptible to eavesdropping since confidential information is broadcasted twice, i.e., by the source and the relay. In particular, we propose a cooperative jamming aided secure transmission through the relay path. Furthermore, with the presence of the direct path, a transmission mode selection scheme is elaborated in such a way to reduce the amount of information leaked to non-selected users in the system, who may overhear the source message as eavesdroppers. Specifically, the selected relay is only activated when it has better secrecy performance than the source. We study the impact of outdated channel state information (CSI) on the system by deriving a closed-form lower bound for the secrecy outage probability (SOP). By investigating the effect of the jamming power level and the correlation coefficients imbalance, a comparison reveals that the proposed scheme outperforms the fixed transmission modes and its signal-to-noise ratio based counterpart. It is shown that the secrecy outage probability can be decreased as the number of destinations grows unless the number of relays is small. Importantly, optimal relay location and jamming power allocation significantly enhance the secrecy performance.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2016•12 citations

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•11 citations

Cooperative Jamming in a Two-Hop Relay Wireless Network with Buffer-Aided Relays

Kenta Sasaki, Xuening Liao, Xiaohong Jiang

In this paper, we consider a two-hop relay wireless network with one source, one destination, one eavesdropper and multiple half-duplex (HD) relays each having a finite buffer. We assume two cases of the eavesdropper's channel state information (CSI), i.e., the perfect CSI case where the instantaneous CSI of the eavesdropper channels are available, and the partial CSI case where only the average CSI of the eavesdropper channels are available. Cooperative jamming schemes are proposed for both eavesdropper's CSI cases, where two relays are selected in each hop, one is selected as a message relay and another as a jammer to transmit jamming signals to degrade the eavesdropper channel. The security performance in terms of the secrecy outage probability (SOP) is analyzed by simulation. We also make comparison between our proposed cooperative jamming schemes with the random jammer selection scheme. Results show that the proposed cooperative jamming scheme outperforms the random jammer selection scheme and the joint consideration of the buffer-aided relay selection and jamming can achieve better security performance.

International Symposium on Computing and Networking•Nov 1, 2017•7 citations
This paper studies cooperative transmission for securing a two‐hop network where the eavesdropper can wiretap the relay channels. With outdated channel state information (CSI), we propose an opportunistic relaying with destination‐based jamming scheme, where one relay is chosen to forward the confidential signal and the destination sends jamming signal to confuse the eavesdropper. To reveal the capability of the proposed scheme in improving the system secrecy, we investigate the two common performance metrics under different assumptions on the eavesdropper CSI. First, lower bound on the ergodic secrecy capacity (ESC) is derived assuming perfect knowledge of the eavesdropper channel gains. We, then, extend our results to the scenario where only the legitimate channel gain is known. Here, lower bound on the secrecy outage probability (SOP) is obtained. To further improve the utility of the destination, under total power constraint, a power allocation between data signal and jamming noise is considered. Both the analysis and simulation results indicate that the system performance is significantly improved in terms of both ESC and SOP when the jamming power at the destination is adjusted according to the selected relay position. We verify that, with outdated CSI, the secrecy performance of opportunistic relaying is severely degraded.
This paper studies the problem of secure dual-hop AF network in the presence of eavesdropper. We study the secrecy performance of partial relay selection with outdated channel state information (CSI). We propose a system secrecy where two sources and destination simultaneously transmit the legitimate and the jamming signal respectively. The selected relay forwards the combined signal to the legitimate receiver and the eavesdropper. We derive a closed-form expression for lower bound on the ergodic secrecy capacity (ESC) under different assumptions of the eavesdropper channel gains. We verify that the system performance is degraded as the correlation coefficient decreases. Simulation results are considered to verify the exactness of the proposed mathematical analysis.
This paper studies the secrecy performance of an untrusted amplify-and-forward relaying network where both the relaying and the direct links are used to convey the source's information. Since relays act as eavesdroppers, a source-based jamming technique is proposed to keep the source's message secret from these helper nodes. We analyze the secrecy capacity of partial relay selection based on outdated channel state information. The study is conducted analytically by deriving the lower-bound expression for the ergodic secrecy capacity (ESC). We demonstrate through the simulation results the tightness of the derived bound. The use of the direct link is shown to improve the secrecy performance of the proposed scheme. In this case, we found that ESC performance with maximum ratio combining at the destination is better than that with selection combining. The system performance worsens as the correlation coefficient decreases. Furthermore, the maximum of ESC is achieved when relays are in the middle between the source and the destination with equal power allocation between the information and the jamming signals at the source.
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.
We study a relay and user selection scheme to improve the secrecy performance of cooperative multi-user multiple amplify-and-forward (AF) relay network. Nevertheless, relay transmission is highly susceptible to eavesdropping since confidential information is broadcasted twice, i.e., by the source and the relay. In particular, we propose a cooperative jamming aided secure transmission through the relay path. Furthermore, with the presence of the direct path, a transmission mode selection scheme is elaborated in such a way to reduce the amount of information leaked to non-selected users in the system, who may overhear the source message as eavesdroppers. Specifically, the selected relay is only activated when it has better secrecy performance than the source. We study the impact of outdated channel state information (CSI) on the system by deriving a closed-form lower bound for the secrecy outage probability (SOP). By investigating the effect of the jamming power level and the correlation coefficients imbalance, a comparison reveals that the proposed scheme outperforms the fixed transmission modes and its signal-to-noise ratio based counterpart. It is shown that the secrecy outage probability can be decreased as the number of destinations grows unless the number of relays is small. Importantly, optimal relay location and jamming power allocation significantly enhance the secrecy performance.
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 consider a two-hop relay wireless network with one source, one destination, one eavesdropper and multiple half-duplex (HD) relays each having a finite buffer. We assume two cases of the eavesdropper's channel state information (CSI), i.e., the perfect CSI case where the instantaneous CSI of the eavesdropper channels are available, and the partial CSI case where only the average CSI of the eavesdropper channels are available. Cooperative jamming schemes are proposed for both eavesdropper's CSI cases, where two relays are selected in each hop, one is selected as a message relay and another as a jammer to transmit jamming signals to degrade the eavesdropper channel. The security performance in terms of the secrecy outage probability (SOP) is analyzed by simulation. We also make comparison between our proposed cooperative jamming schemes with the random jammer selection scheme. Results show that the proposed cooperative jamming scheme outperforms the random jammer selection scheme and the joint consideration of the buffer-aided relay selection and jamming can achieve better security performance.