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

高技术通讯：英文版

Secrecy rate analysis of dual-hop AF relay wiretap channel

丁飞, Song, Ai-guo, Li, Jianqing, Wu, Zhenyang

Published Jan 1, 2014• 0 citations
OpenAlex

Abstract

An amplify-and-forward(AF) dual-hop relay is proposed for secure communication within Wyner s wiretap channel.Based on an information-theoretic formulation,the average secrecy rate is characterized when two legitimate partners communicate over a quasi-static fading channel.Theoretical analysis and simulation results show that both cooperative strategies of average power scaling(APS) and instantaneous power scaling(IPS) are proved to be able to achieve information-theoretic security,and eavesdropper is unable to decode any information.

Related papers

Analyzing Amplify-and-Forward and Decode-and-Forward Cooperative Strategies in Wyner's Channel Model

Pengyu Zhang, Jian Yuan, Jianshu Chen +2 more

The benefits of Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative relay for secure communication are investigated within Wyner's wiretap channel. We characterize the secrecy rate when source, destination, relay and eavesdropper all use single antenna and the channel conditions are fix. Both AF and DF cooperative strategies are proved theoretically to be able to facilitate secure communication. Detailed analysis of AF and DF scheme reveals a trade off between secrecy area and request secrecy rate. In addition, secrecy constraints in cooperative secure communication are discussed and are used to explain the differences in AF and DF scheme. Overall, our work establishes the utility of cooperation and compares each advantage of AF and DF scheme in facilitating secure communication over wireless channel.

IEEE Wireless Communications and Networking Conference•Apr 1, 2009•41 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

On the secrecy capacity of cooperative wiretap channel

Meysam Mirzaee, Soroush Akhlaghi

Secure communications using physical layer characteristics has attracted many attentions in recent years. Secrecy capacity of communication systems can be increased by using multiple-antenna nodes. In this paper, we concentrate on the cooperative wiretap channel in which confidential messages are sent from a source to a legitimate receiver with the help of a relay in the presence of an eavesdropper. We study the secrecy capacity of Amplify and Forward (AF) relaying under peak power constraint at the relay node. To this end, we first evaluate an achievable secrecy rate for Gaussian input by solving a nonconvex optimization problem. Then, we prove the converse by using the secrecy capacity of genie-aided channel as an upper bound of the secrecy capacity of interested channel. We show that this upper bound is achievable and equal to achievable secrecy rate of Gaussian input.

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

Performance analysis of cooperative schemes under total transmit power constraint in single hop wireless relaying system

Rupali Sinha, Poonam Jindal

In wireless communication, physical layer security is widely used for secure communication between the transmitter and the receiver. In this paper, the secrecy performance of two cooperative schemes, decode-and-forward (DF) and amplify-and-forward (AF) relays is investigated in a single hop wireless relaying system. The achievable secrecy rate is investigated with these two types of relays under the constraint of total power transmitted. In the given jamming relay network, the relay transmits jamming signal while receiving data signal from the source. It is indicated by the resulting analysis that the AF relays have better secrecy rate as compared to the DF relays in the given condition. The secrecy rate of the AF relay is higher than that of the DF relay by 71.88% at a distance of 70 m between the relay and the eavesdropper in this jamming relay network.

International Conference on Communication, Control and Intelligent Systems (CCIS)•Nov 1, 2016•3 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 protocols in two hop amplify-and-forward wiretap channels

Fang Dong, Nan Yang, Maged Elkashlan +2 more

In this paper, we propose two cooperative jamming protocols in two-hop amplify-and-forward (AF) wiretap channels: 1) jamming signal at the source (JSS) and 2) jamming signal at the relay (JSR). We apply optimal power allocation (OPA) between the useful signal and the jamming signal to maximize the secrecy rate for each of the protocols. A fundamental question to address is “Which cooperative jamming protocol is superior under OPA?” To this end, we evaluate the maximum secrecy rate of JSS and JSR for the general scenario of independent but not necessarily identically distributed fading with distinct average signal-to-noise ratios (SNRs) in the first hop, the second hop, and the wiretap link. We demonstrate that the strong first and second hops equally benefit the secrecy rates of JSS and JSR, when the wiretap link is weak. When the wiretap link is strong, the secrecy rate of JSR is superior to JSS.

International Conference on Communications•Jun 1, 2013•18 citations
An amplify-and-forward(AF) dual-hop relay is proposed for secure communication within Wyner s wiretap channel.Based on an information-theoretic formulation,the average secrecy rate is characterized when two legitimate partners communicate over a quasi-static fading channel.Theoretical analysis and simulation results show that both cooperative strategies of average power scaling(APS) and instantaneous power scaling(IPS) are proved to be able to achieve information-theoretic security,and eavesdropper is unable to decode any information.
The benefits of Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative relay for secure communication are investigated within Wyner's wiretap channel. We characterize the secrecy rate when source, destination, relay and eavesdropper all use single antenna and the channel conditions are fix. Both AF and DF cooperative strategies are proved theoretically to be able to facilitate secure communication. Detailed analysis of AF and DF scheme reveals a trade off between secrecy area and request secrecy rate. In addition, secrecy constraints in cooperative secure communication are discussed and are used to explain the differences in AF and DF scheme. Overall, our work establishes the utility of cooperation and compares each advantage of AF and DF scheme in facilitating secure communication over wireless channel.
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.
Secure communications using physical layer characteristics has attracted many attentions in recent years. Secrecy capacity of communication systems can be increased by using multiple-antenna nodes. In this paper, we concentrate on the cooperative wiretap channel in which confidential messages are sent from a source to a legitimate receiver with the help of a relay in the presence of an eavesdropper. We study the secrecy capacity of Amplify and Forward (AF) relaying under peak power constraint at the relay node. To this end, we first evaluate an achievable secrecy rate for Gaussian input by solving a nonconvex optimization problem. Then, we prove the converse by using the secrecy capacity of genie-aided channel as an upper bound of the secrecy capacity of interested channel. We show that this upper bound is achievable and equal to achievable secrecy rate of Gaussian input.
In wireless communication, physical layer security is widely used for secure communication between the transmitter and the receiver. In this paper, the secrecy performance of two cooperative schemes, decode-and-forward (DF) and amplify-and-forward (AF) relays is investigated in a single hop wireless relaying system. The achievable secrecy rate is investigated with these two types of relays under the constraint of total power transmitted. In the given jamming relay network, the relay transmits jamming signal while receiving data signal from the source. It is indicated by the resulting analysis that the AF relays have better secrecy rate as compared to the DF relays in the given condition. The secrecy rate of the AF relay is higher than that of the DF relay by 71.88% at a distance of 70 m between the relay and the eavesdropper in this jamming relay network.
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.
In this paper, we propose two cooperative jamming protocols in two-hop amplify-and-forward (AF) wiretap channels: 1) jamming signal at the source (JSS) and 2) jamming signal at the relay (JSR). We apply optimal power allocation (OPA) between the useful signal and the jamming signal to maximize the secrecy rate for each of the protocols. A fundamental question to address is “Which cooperative jamming protocol is superior under OPA?” To this end, we evaluate the maximum secrecy rate of JSS and JSR for the general scenario of independent but not necessarily identically distributed fading with distinct average signal-to-noise ratios (SNRs) in the first hop, the second hop, and the wiretap link. We demonstrate that the strong first and second hops equally benefit the secrecy rates of JSS and JSR, when the wiretap link is weak. When the wiretap link is strong, the secrecy rate of JSR is superior to JSS.