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

KSII Transactions on Internet and Information Systems

Secrecy Analysis of Amplify-and-Forward Relay Networks with Beamforming

Pu Chen, Jian Ouyang, Wei‐Ping Zhu

Published Oct 31, 2016• 1 citation
Publisher
DOI
10.3837/tiis.2016.10.022

Related papers

Secrecy performance analysis of amplify-and-forward relay cooperative networks with simultaneous wireless information and power transfer

Sahar Parkouk, Mohammad Ali Torabi, Saeed Shokrollahi

Computer Communications•Jul 13, 2022•12 citations

Secrecy performance analysis of amplify-and-forward cooperative network with relay selection in the presence of multiple eavesdroppers

Mohammad Ali Torabi, Sahar Parkouk, Saeed Shokrollahi

Wireless Networks•May 1, 2021•11 citations

Distributed beamforming designs to improve physical layer security in wireless relay networks

Mujun Qian, Chen Liu, Youhua Fu

Abstract This paper investigates security-oriented beamforming designs in a relay network composed of a source-destination pair, multiple relays, and a passive eavesdropper. Unlike most of the earlier works, we assume that only statistical information of the relay-eavesdropper channels is known to the relays. We propose beamforming solutions for amplify-and-forward (AF) and decode-and-forward (DF) relay networks to improve secrecy capacity. In an AF network, the beamforming design is obtained by approximating a product of two correlated Rayleigh quotients to a single Rayleigh quotient using the Taylor series expansion. Our study reveals that in an AF network, the secrecy capacity does not always grow as the eavesdropper moves away from the relays or as total relay transmit power increases. Moreover, if the destination is nearer to the relays than the eavesdropper is, a suboptimal power is derived in closed form through monotonicity analysis of secrecy capacity. While in a DF network, secrecy capacity is a single Rayleigh quotient problem which can be easily solved. We also found that if the relay-eavesdropper distances are about the same, it is unnecessary to consider the eavesdropper in a DF network. Numerical results show that for either AF or DF relaying protocol, the proposed beamforming scheme provides higher secrecy capacity than traditional approaches.

EURASIP Journal on Advances in Signal Processing•Apr 28, 2014•7 citations

Distributed Secrecy Beamforming and Precoding in Multi-Antenna Wireless Relay Systems

Y.-W. Peter Hong, Pang-Chang Lan, C.‐C. Jay Kuo

Springer briefs in electrical and computer engineering•Sep 26, 2013•0 citations

Secure Beamforming and Ergodic Secrecy Rate Analysis for Amplify-and-Forward Relay Networks With Wireless Powered Jammer

Omer Waqar, Hina Tabassum, Raviraj Adve

In this correspondence, we consider an amplify-and-forward relay network in which relayed information is overheard by an eavesdropper. In order to confound the eavesdropper, a wireless-powered jammer is also considered which harvests energy from a multiple-antenna source. We proposed a new secure beamforming scheme in which beamforming vector is a linear combination of the energy beamforming (EB) and information beamforming (IB) vectors. In particular, we present a new closed-form solution for the proposed beamforming vector which is shown to achieve a near-optimal secrecy capacity for asymptotic regime of a large number of antennas at the source. Moreover, it is also demonstrated that the proposed beamforming vector achieves significantly higher secrecy rate as compared to the trivial EB and IB vectors. A tight closed-form approximation for the ergodic secrecy rate is also derived for a large number of antennas. Finally, numerical examples and simulations are provided which validate our analytical results.

arXiv:2007.01391•IEEE Transactions on Vehicular Technology•Mar 3, 2021•11 citations

User power allocation and relay beamforming design for secrecy sum rate maximization in two-way relay networks

Mehdi Cheraghi, Yousef Darmani

AEU - International Journal of Electronics and Communications•Jan 22, 2022•4 citations
Abstract This paper investigates security-oriented beamforming designs in a relay network composed of a source-destination pair, multiple relays, and a passive eavesdropper. Unlike most of the earlier works, we assume that only statistical information of the relay-eavesdropper channels is known to the relays. We propose beamforming solutions for amplify-and-forward (AF) and decode-and-forward (DF) relay networks to improve secrecy capacity. In an AF network, the beamforming design is obtained by approximating a product of two correlated Rayleigh quotients to a single Rayleigh quotient using the Taylor series expansion. Our study reveals that in an AF network, the secrecy capacity does not always grow as the eavesdropper moves away from the relays or as total relay transmit power increases. Moreover, if the destination is nearer to the relays than the eavesdropper is, a suboptimal power is derived in closed form through monotonicity analysis of secrecy capacity. While in a DF network, secrecy capacity is a single Rayleigh quotient problem which can be easily solved. We also found that if the relay-eavesdropper distances are about the same, it is unnecessary to consider the eavesdropper in a DF network. Numerical results show that for either AF or DF relaying protocol, the proposed beamforming scheme provides higher secrecy capacity than traditional approaches.
In this correspondence, we consider an amplify-and-forward relay network in which relayed information is overheard by an eavesdropper. In order to confound the eavesdropper, a wireless-powered jammer is also considered which harvests energy from a multiple-antenna source. We proposed a new secure beamforming scheme in which beamforming vector is a linear combination of the energy beamforming (EB) and information beamforming (IB) vectors. In particular, we present a new closed-form solution for the proposed beamforming vector which is shown to achieve a near-optimal secrecy capacity for asymptotic regime of a large number of antennas at the source. Moreover, it is also demonstrated that the proposed beamforming vector achieves significantly higher secrecy rate as compared to the trivial EB and IB vectors. A tight closed-form approximation for the ergodic secrecy rate is also derived for a large number of antennas. Finally, numerical examples and simulations are provided which validate our analytical results.