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

International Wireless Communications and Mobile Computing Conference (IWCMC)

Secure Semi-Blind AF relaying networks using multiple eavesdroppers

Wided Hadj Alouane

Published Jun 1, 2019• 1 citation
Publisher

Abstract

In this paper, we investigate a secure semi-blind amplify-and-forward (AF) relaying system over Rayleigh fading channels. We consider a reactive relay selection where the relay is selected based on the highest instantaneous signal-to-noise ratio (SNR) of the second hop. We evaluate the ergodic secrecy capacity using source-assisted jamming (SAJ) and considering that relays act as eavesdroppers. In order to improve the secrecy performance, a direct link between the source and destination is considered. Numerical results are presented to verify the accuracy of the proposed mathematical analysis. Moreover, a comparison between secure semi-blind AF relaying system and secure channel-state-information (CSI)-assisted AF relaying system is performed to further prove the exactness of our analysis. The proposed secure semi-blind AF relaying system has a simpler mathematical analysis and a comparable secrecy performance as compared to secure CSI-assisted AF relaying system.

DOI
10.1109/iwcmc.2019.8766643

Related papers

Partial Relay Selection for Secure Outdated-CSI AF in Untrusted-Relay Networks

Wided Hadj Alouane

In this paper, we study secure outdated-channel-state-information amplify-and-forward (SO-CSI-AF) relaying network using partial relay selection method. The best relay node is chosen based on the maximum instantaneous signal-to-noise ratio (SNR) of the first hop. We analyze a system with one source, multiple untrusted relays and one destination, where the relays act as eavesdroppers and a source-assisted-jamming technique is adopted. The jamming signal is transmitted by the source node to convey the information signal. We provide a closed-form expression for ergodic secrecy capacity considering Rayleigh fading channels. The accuracy of our proposed analysis is well demonstrated by simulation results. Moreover, we compare partial relay selection with reactive relay selection in secure untrusted relay networks. We obtain that our proposed system provides better performance especially when the relay is placed closer to the destination.

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

Secure two-user AF relaying networks using cooperative jamming

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

In this paper, we investigate secure two-user AF relaying networks based on a destination assisted cooperative jamming (DACJ). We consider two sources, one destination, one eavesdropper and multiple amplify-and-forwards (AF) relays. In the first time slot, each source broadcasts the information signal to the relays. In order to protect the source message from being eavesdropped, the destination simultaneously transmits a jamming signal to each relay. The selected relay amplifies and forwards the combined signal to the destination and eavesdropper. We introduce reactive relay selection and power allocation to decrease the power consumption. Closed-form expressions for lower bound of ergodic secrecy capacity (ESC) are provided. Numerical results are presented to verify the exactness of the proposed mathematical analysis.

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

High SNR performance of amplify-and-forward relaying in Rayleigh fading wiretap channels

Frédéric Gabry, Somayeh Salimi, Ragnar Thobaben +1 more

This paper investigates amplify-and-forward (AF) relaying for secrecy in quasi-static Rayleigh fading channels. We consider a four-node network where a helping node intends to enhance secrecy of the transmission between the source and the destination in presence of a passive eavesdropper. In this scenario, the common assumption of full CSI on the eavesdropper's channels is not realistic, and thus, we study the performance of cooperation from an outage perspective. Starting from the secrecy outage probability, we introduce a novel measure, the conditional secrecy outage probability to analyze the performance of AF. In particular, we derive closed-form expressions for AF for these two secrecy measures under a high SNR assumption. Moreover, we use numerical examples to illustrate our results and to characterize the effect of the nodes' geometry. We also show numerically how AF improves the secrecy performance in comparison to direct transmission in terms of outage probability and secure throughput.

Iran Workshop on Communication and Information Theory (IWCIT)•May 1, 2013•6 citations

Secrecy Outage of Dual-Hop AF Relay System With Relay Selection Without Eavesdropper's CSI

Abhishek Jindal, Chinmoy Kundu, Ranjan Bose

We evaluate the upper bound, lower bound and an approximate expression for secrecy outage probability of a dual hop Amplify-and-forward (AF) relay system when the single cooperating relay among the relays is selected without the knowledge of eavesdropper's instantaneous channel state information (CSI). This situation arises when eavesdropper is not a legitimate node, or being a trusted node, it acts maliciously and does not share its instantaneous CSI. We also obtain the tighter bounds in high signal-to-noise ratio (SNR) of the source to relay links and in high SNR of the relay to destination links. We show that when the SNR of the source to relay links tends to zero, it becomes the bottle neck for secure communication, and the secrecy outage tends to 1. We show that the approximate expression follows the simulated outage closely and the outage decreases with an increase in the number of relays and increases with an increase in the required secrecy rate.

IEEE Communications Letters•Jul 16, 2014•40 citations

Relay self-selection for secure cooperative in Amplify-And-Forward networks

Shi Yan, Mugen Peng, Wenbo Wang +2 more

Cooperative communication in wireless relay systems can improve the physical layer security, and the relay selection has great impacts on the security performances. In this paper the relay selection in Amplify-and-Forward (AF) cooperative networks is investigated. The system model constitutes of a source, an eavesdropper, a destination, and a number of intermediate nodes with secrecy constraints. The proposed optimal selection (OS) algorithm is based on the instantaneous channel state information (CSI) of two hops, jointly protects the target destination against eavesdropping and interference. To simplify the complexity of OS, the suboptimal selection (SS) algorithm is also presented, which is based on the instantaneous of the first hop and the statistical CSI of the second hop respectively. The secrecy capacity and secrecy outage probability of these two relay selection algorithms are analyzed. Simulation results of OS and SS validate our theoretical analysis and show enhancement in the secrecy rate over the direct transmission.

International Conference on Communications and Networking in China (ChinaCom)•Aug 1, 2012•7 citations

Cooperative jamming AF networks via Nakagami‐m fading channels

Wided Hadj Alouane, Hatem Boujemâa

Abstract In this paper, we highlight a secure reactive amplify‐and‐forward relaying system over Nakagami‐m fading channels in the presence of multiple eavesdroppers. We study a destination‐assisted jamming scheme to strengthen the wireless security against any malicious attack. We define a reactive selection where the cooperating node is chosen according to the maximum instantaneous signal‐to‐noise ratio of the second hop. We provide, as well, an optimal power allocation and an approximate analysis for the ergodic secrecy capacity. A selection of simulation results is illustrated to confirm the accuracy of the proposed theoretical analysis.

Transactions on Emerging Telecommunications Technologies•Nov 26, 2019•2 citations
In this paper, we investigate a secure semi-blind amplify-and-forward (AF) relaying system over Rayleigh fading channels. We consider a reactive relay selection where the relay is selected based on the highest instantaneous signal-to-noise ratio (SNR) of the second hop. We evaluate the ergodic secrecy capacity using source-assisted jamming (SAJ) and considering that relays act as eavesdroppers. In order to improve the secrecy performance, a direct link between the source and destination is considered. Numerical results are presented to verify the accuracy of the proposed mathematical analysis. Moreover, a comparison between secure semi-blind AF relaying system and secure channel-state-information (CSI)-assisted AF relaying system is performed to further prove the exactness of our analysis. The proposed secure semi-blind AF relaying system has a simpler mathematical analysis and a comparable secrecy performance as compared to secure CSI-assisted AF relaying system.
In this paper, we study secure outdated-channel-state-information amplify-and-forward (SO-CSI-AF) relaying network using partial relay selection method. The best relay node is chosen based on the maximum instantaneous signal-to-noise ratio (SNR) of the first hop. We analyze a system with one source, multiple untrusted relays and one destination, where the relays act as eavesdroppers and a source-assisted-jamming technique is adopted. The jamming signal is transmitted by the source node to convey the information signal. We provide a closed-form expression for ergodic secrecy capacity considering Rayleigh fading channels. The accuracy of our proposed analysis is well demonstrated by simulation results. Moreover, we compare partial relay selection with reactive relay selection in secure untrusted relay networks. We obtain that our proposed system provides better performance especially when the relay is placed closer to the destination.
In this paper, we investigate secure two-user AF relaying networks based on a destination assisted cooperative jamming (DACJ). We consider two sources, one destination, one eavesdropper and multiple amplify-and-forwards (AF) relays. In the first time slot, each source broadcasts the information signal to the relays. In order to protect the source message from being eavesdropped, the destination simultaneously transmits a jamming signal to each relay. The selected relay amplifies and forwards the combined signal to the destination and eavesdropper. We introduce reactive relay selection and power allocation to decrease the power consumption. Closed-form expressions for lower bound of ergodic secrecy capacity (ESC) are provided. Numerical results are presented to verify the exactness of the proposed mathematical analysis.
This paper investigates amplify-and-forward (AF) relaying for secrecy in quasi-static Rayleigh fading channels. We consider a four-node network where a helping node intends to enhance secrecy of the transmission between the source and the destination in presence of a passive eavesdropper. In this scenario, the common assumption of full CSI on the eavesdropper's channels is not realistic, and thus, we study the performance of cooperation from an outage perspective. Starting from the secrecy outage probability, we introduce a novel measure, the conditional secrecy outage probability to analyze the performance of AF. In particular, we derive closed-form expressions for AF for these two secrecy measures under a high SNR assumption. Moreover, we use numerical examples to illustrate our results and to characterize the effect of the nodes' geometry. We also show numerically how AF improves the secrecy performance in comparison to direct transmission in terms of outage probability and secure throughput.
We evaluate the upper bound, lower bound and an approximate expression for secrecy outage probability of a dual hop Amplify-and-forward (AF) relay system when the single cooperating relay among the relays is selected without the knowledge of eavesdropper's instantaneous channel state information (CSI). This situation arises when eavesdropper is not a legitimate node, or being a trusted node, it acts maliciously and does not share its instantaneous CSI. We also obtain the tighter bounds in high signal-to-noise ratio (SNR) of the source to relay links and in high SNR of the relay to destination links. We show that when the SNR of the source to relay links tends to zero, it becomes the bottle neck for secure communication, and the secrecy outage tends to 1. We show that the approximate expression follows the simulated outage closely and the outage decreases with an increase in the number of relays and increases with an increase in the required secrecy rate.
Cooperative communication in wireless relay systems can improve the physical layer security, and the relay selection has great impacts on the security performances. In this paper the relay selection in Amplify-and-Forward (AF) cooperative networks is investigated. The system model constitutes of a source, an eavesdropper, a destination, and a number of intermediate nodes with secrecy constraints. The proposed optimal selection (OS) algorithm is based on the instantaneous channel state information (CSI) of two hops, jointly protects the target destination against eavesdropping and interference. To simplify the complexity of OS, the suboptimal selection (SS) algorithm is also presented, which is based on the instantaneous of the first hop and the statistical CSI of the second hop respectively. The secrecy capacity and secrecy outage probability of these two relay selection algorithms are analyzed. Simulation results of OS and SS validate our theoretical analysis and show enhancement in the secrecy rate over the direct transmission.
Abstract In this paper, we highlight a secure reactive amplify‐and‐forward relaying system over Nakagami‐m fading channels in the presence of multiple eavesdroppers. We study a destination‐assisted jamming scheme to strengthen the wireless security against any malicious attack. We define a reactive selection where the cooperating node is chosen according to the maximum instantaneous signal‐to‐noise ratio of the second hop. We provide, as well, an optimal power allocation and an approximate analysis for the ergodic secrecy capacity. A selection of simulation results is illustrated to confirm the accuracy of the proposed theoretical analysis.