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 International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN)

Capacity Analysis for Secure Amplify-and-Forward Two-Way Relay Networks with Channel Estimation Errors

Yang Liu, Zhangdui D. Zhong, Rongtao Xu, Gongpu Wang

Published Jan 1, 2013• 2 citations
Publisher

Abstract

In this paper, we study the channel estimation and data detection problem for secure Amplify-and-Forward two-way relay networks. It is shown that for the eavesdropper node, the signal processing process of channel estimation and data detection is quiet different from that of the destination node. The channel estimation errors of both the legal user and the eavesdropper are studied. Next we derive the closed-form expression of channel capacity with imperfect channel state information. Simulations are then provided to corroborate the proposed studies.

DOI
10.1049/cp.2013.2394

Related papers

Secure Communication in Two-Way Relay Networks with Channel Estimation Errors

Yao Chenhong, Pei Changxing, Jing Guo

In this paper, we investigate the secrecy outage probability (SOP) for the cooperative amplify-and-forward (AF) two-way relay networks (TWRN) with channel estimation (CE) errors under Rayleigh fading channels.In the proposed system, two sources simultaneously broadcast their respective information to all the relays firstly.Then, the optimal relay performs AF protocol on the received signals sent from the two sources and forward them to both sources.In both phases, An eavesdropper receives the signals from sources and relay nodes illegally.The performance of the proposed system is quantified by deriving the upper bound of the overall outage probability.Impact of CEs on the system is illustrated by simulations.

International Journal of Security and Its Applications•Aug 31, 2016•0 citations

On the conditioning channel capacity of MIMO two-way relay networks against eavesdropper

Jia You, Zhangdui D. Zhong, Feifei Gao +1 more

In this paper, we consider the two-way relay network (TWRN) in the presence of an eavesdropper, and construct a noisy amplify-and-forward (AF) algorithm to enhance the physical (PHY) layer security capacity. All the source nodes, the relay and the eavesdropper are equipped with multiple antennas. In the proposed noisy AF scheme, the relay first receives signals from both source nodes, adds weighted artificial noise (AN), and then amplifies and forwards the modified signal to both source nodes. In this scenario, we analyze the effects of AN and the number of relay antennas on the secrecy sum rate for different conditioning channel matrices. It is shown that AN will result in an increased secrecy sum rate, and the channel condition is a key parameter of the system in deciding the sum secrecy rate. Finally, simulation results demonstrate the validity of proposed studies.

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

Secure Communication for Two-Way Relay Networks with Imperfect CSI

Cong Sun, Ke Liu, Dahu Zheng +1 more

This paper considers a two-way relay network, where two legitimate users exchange messages through several cooperative relays in the presence of an eavesdropper, and the Channel State Information (CSI) of the eavesdropper is imperfectly known. The Amplify-and-Forward (AF) relay protocol is used. We design the relay beamforming weights to minimize the total relay transmit power, while requiring the Signal-to-Noise-Ratio (SNRs) of the legitimate users to be higher than the given thresholds and the achievable rate of the eavesdropper to be upper-bounded. Due to the imperfect CSI, a robust optimization problem is summarized. A novel iterative algorithm is proposed, where the line search technique is applied, and the feasibility is preserved during iterations. In each iteration, two Quadratically-Constrained Quadratic Programming (QCQP) subproblems and a one-dimensional subproblem are optimally solved. The optimality property of the robust optimization problem is analyzed. Simulation results show that the proposed algorithm performs very close to the non-robust model with perfect CSI, in terms of the obtained relay transmit power; it~achieves higher secrecy rate compared to the existing work. Numerically, the proposed algorithm converges very quickly, and more than 85% of the problems are solved optimally.

Entropy•Sep 29, 2017•7 citations

Secure Capacity Analysis of Untrusted Relaying Energy Harvesting Systems with Multiple Eavesdroppers

Van Phu Tuan, Thi Anh Le, Vo Nguyen Quoc Bao +1 more

In this paper, we investigate the secure capacity of a cooperative energy-harvesting communication via an amplify-and-forward (AF) untrusted relay, which can be a potential eavesdropper, in the presences of multiple external eavesdroppers. The eavesdropper network chooses an eavesdropper which possesses the highest source-eavesdropper channel gain for overhearing the source's confidential signal. To degrade the signal quality at the untrusted relay and the best eavesdropper while maintaining signal quality at the destination, the destination sends artificial noise (AN) during the communication. Both the source signal and AN can be exploited as energy sources. We derive the analytical expression for the average secrecy capacity (ASC) for evaluating the secure capacity. The accuracy of analytical results is verified by Monte Carlo simulations.

International Symposium on Communications and Information Technologies•Sep 1, 2019•0 citations

Secrecy Analysis of Multiuser Untrusted Amplify-and-Forward Relay Networks

Dan Deng, Xutao Li, Lisheng Fan +3 more

This paper investigates the secure communications of multiuser untrusted amplify-and-forward relay networks in the presence of direct links. In the considered system, one user is selected among multiple ones for secure transmission to the destination node with the help of an untrusted relay node. To reduce the information leakage to the untrusted relay, the paper considers two selection criteria to select the user based on the direct and the relaying links, respectively. The impact of direct and the relaying link on the system secrecy performance is studied by deriving the close-form ergodic secrecy rate (ESR) as well as the asymptotic expression. From the asymptotic expression, it can be found that the asymptotic ESR increases linearly with the logarithm of the average channel gain ratio of the direct link to the relaying link.

Wireless Communications and Mobile Computing•Jan 1, 2017•13 citations

Secrecy Outage Probability of Cooperative Relay Networks with Channel Estimation Error

Yulong Zou, Lidong Cai, Haiyan Guo +1 more

In this paper, we consider a dual-hop decode-and-forward (DF) relay network which consists of a source, a destination and multiple DF relays in the presence of an eavesdropper, where the source transmits its data to the destination with the help of DF relays while the eavesdropper attempts to tap the relay transmissions. We examine the impact of channel estimation errors on the secrecy performance of source-destination transmissions and propose an optimal relay selection scheme for improving the transmission security against eavesdropping. To be specific, the proposed relay selection is designed by considering the fact that the channel state information (CSI) of any link from the source via DF relays to destination is inaccurate with channel estimation errors. The traditional round-robin relay selection is also considered for comparison purposes. We derive close-form expressions of the secrecy outage probability for both the proposed optimal relay selection scheme and traditional round-robin relay selection schemes. Numerical results demonstrate an adverse effect of the channel estimation errors on the secrecy outage probability of cooperative relay systems. Additionally, it is shown that the proposed optimal relay selection scheme substantially outperforms the traditional round-robin selection approach in terms of the secrecy outage probability.

Globecom•Dec 1, 2018•1 citation
In this paper, we study the channel estimation and data detection problem for secure Amplify-and-Forward two-way relay networks. It is shown that for the eavesdropper node, the signal processing process of channel estimation and data detection is quiet different from that of the destination node. The channel estimation errors of both the legal user and the eavesdropper are studied. Next we derive the closed-form expression of channel capacity with imperfect channel state information. Simulations are then provided to corroborate the proposed studies.
In this paper, we investigate the secrecy outage probability (SOP) for the cooperative amplify-and-forward (AF) two-way relay networks (TWRN) with channel estimation (CE) errors under Rayleigh fading channels.In the proposed system, two sources simultaneously broadcast their respective information to all the relays firstly.Then, the optimal relay performs AF protocol on the received signals sent from the two sources and forward them to both sources.In both phases, An eavesdropper receives the signals from sources and relay nodes illegally.The performance of the proposed system is quantified by deriving the upper bound of the overall outage probability.Impact of CEs on the system is illustrated by simulations.
In this paper, we consider the two-way relay network (TWRN) in the presence of an eavesdropper, and construct a noisy amplify-and-forward (AF) algorithm to enhance the physical (PHY) layer security capacity. All the source nodes, the relay and the eavesdropper are equipped with multiple antennas. In the proposed noisy AF scheme, the relay first receives signals from both source nodes, adds weighted artificial noise (AN), and then amplifies and forwards the modified signal to both source nodes. In this scenario, we analyze the effects of AN and the number of relay antennas on the secrecy sum rate for different conditioning channel matrices. It is shown that AN will result in an increased secrecy sum rate, and the channel condition is a key parameter of the system in deciding the sum secrecy rate. Finally, simulation results demonstrate the validity of proposed studies.
This paper considers a two-way relay network, where two legitimate users exchange messages through several cooperative relays in the presence of an eavesdropper, and the Channel State Information (CSI) of the eavesdropper is imperfectly known. The Amplify-and-Forward (AF) relay protocol is used. We design the relay beamforming weights to minimize the total relay transmit power, while requiring the Signal-to-Noise-Ratio (SNRs) of the legitimate users to be higher than the given thresholds and the achievable rate of the eavesdropper to be upper-bounded. Due to the imperfect CSI, a robust optimization problem is summarized. A novel iterative algorithm is proposed, where the line search technique is applied, and the feasibility is preserved during iterations. In each iteration, two Quadratically-Constrained Quadratic Programming (QCQP) subproblems and a one-dimensional subproblem are optimally solved. The optimality property of the robust optimization problem is analyzed. Simulation results show that the proposed algorithm performs very close to the non-robust model with perfect CSI, in terms of the obtained relay transmit power; it~achieves higher secrecy rate compared to the existing work. Numerically, the proposed algorithm converges very quickly, and more than 85% of the problems are solved optimally.
In this paper, we investigate the secure capacity of a cooperative energy-harvesting communication via an amplify-and-forward (AF) untrusted relay, which can be a potential eavesdropper, in the presences of multiple external eavesdroppers. The eavesdropper network chooses an eavesdropper which possesses the highest source-eavesdropper channel gain for overhearing the source's confidential signal. To degrade the signal quality at the untrusted relay and the best eavesdropper while maintaining signal quality at the destination, the destination sends artificial noise (AN) during the communication. Both the source signal and AN can be exploited as energy sources. We derive the analytical expression for the average secrecy capacity (ASC) for evaluating the secure capacity. The accuracy of analytical results is verified by Monte Carlo simulations.
This paper investigates the secure communications of multiuser untrusted amplify-and-forward relay networks in the presence of direct links. In the considered system, one user is selected among multiple ones for secure transmission to the destination node with the help of an untrusted relay node. To reduce the information leakage to the untrusted relay, the paper considers two selection criteria to select the user based on the direct and the relaying links, respectively. The impact of direct and the relaying link on the system secrecy performance is studied by deriving the close-form ergodic secrecy rate (ESR) as well as the asymptotic expression. From the asymptotic expression, it can be found that the asymptotic ESR increases linearly with the logarithm of the average channel gain ratio of the direct link to the relaying link.
In this paper, we consider a dual-hop decode-and-forward (DF) relay network which consists of a source, a destination and multiple DF relays in the presence of an eavesdropper, where the source transmits its data to the destination with the help of DF relays while the eavesdropper attempts to tap the relay transmissions. We examine the impact of channel estimation errors on the secrecy performance of source-destination transmissions and propose an optimal relay selection scheme for improving the transmission security against eavesdropping. To be specific, the proposed relay selection is designed by considering the fact that the channel state information (CSI) of any link from the source via DF relays to destination is inaccurate with channel estimation errors. The traditional round-robin relay selection is also considered for comparison purposes. We derive close-form expressions of the secrecy outage probability for both the proposed optimal relay selection scheme and traditional round-robin relay selection schemes. Numerical results demonstrate an adverse effect of the channel estimation errors on the secrecy outage probability of cooperative relay systems. Additionally, it is shown that the proposed optimal relay selection scheme substantially outperforms the traditional round-robin selection approach in terms of the secrecy outage probability.