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

IEEE Transactions on Vehicular Technology

Secure Relay Beamforming With Imperfect Channel Side Information

Xiyuan Wang, Kun Wang, Xian‐Da Zhang

Published Nov 30, 2012• 105 citations
Publisher

Abstract

In this paper, we study the robust relay beamformer design problem in the relay-eavesdropper network with imperfect knowledge of the eavesdropper's channel. In this network, the half-duplexing relay is equipped with multiple antennas and employs the amplify-and-forward (AF) relaying protocol. Assuming static legitimate links, we consider the relay beamforming problem under two models for the eavesdropper's channel: 1) the Rician fading channel model, where only statistical information of the eavesdropper's channel is known by the legitimate nodes; and 2) the deterministic uncertainty model, where the uncertainty region of the eavesdropper's channel vector is modeled as a sphere. As for the optimization criteria, we use an approximation of the ergodic secrecy rate under the Rician fading model and the worst-case secrecy rate under the deterministic uncertainty model. Under both models, the optimal rank-1, match-and-forward (MF), and zero-forcing (ZF) beamformers are developed, and the equivalence of the optimal rank-1 beamformer and the optimal MF beamformer is also established. Under the Rician fading model, it is shown that the optimal ZF beamformer may have a rank greater than 1 and, therefore, could outperform the optimal MF beamformer, whereas under the deterministic uncertainty model, the optimal ZF beamformer must be rank-1. Numerical results are presented to verify the effectiveness of the proposed relay beamformers.

DOI
10.1109/tvt.2012.2230657

Related papers

Robust relay beamforming for multiple-antenna amplify-and-forward relay system in the presence of eavesdropper

Xiyuan Wang, Zhongshan Zhang, Keping Long

The problem of robust relay beamforming for the multiple-antenna amplify-and-forward (AF) relay network in the presence of an eavesdropper is studied in the paper, with the partial eavesdropper's channel side information (ECSI) scenario being considered. In our work, the uncertainty of ECSI is modeled by using a bounded region, which imposes independent constraints on the channel gain and direction. We propose a new rank-2 relay beamformer with a special singular value decomposition (SVD) structure, whose optimal solution for the worst-case secrecy rate maximization problem can be derived via simple line searching. Furthermore, the asymptotic optimality of the proposed rank-2 beamformer is proved in the high-relay-power region under certain condition, with the performance of the proposed beamformer being verified by using numerical experiments.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•5 citations

Secure Beamforming for Multiple-Antenna Amplify-and-Forward Relay Networks

Xiyuan Wang, Zhongshan Zhang, Keping Long

In this paper, we investigate the secure relay beamforming problems for the amplify-and-forward (AF) relay network, where the transmitter sends the information to the receiver with the help of a multiple-antenna relay in the presence of an eavesdropper. We first study the secrecy rate maximization (SRM) problem in the case of complete channel state information (CSI). The rank-1 relay beamformer, which has been solved in our previous work in “Secure relay beamforming with imperfect channel side information,” IEEE Trans. Veh. Technol., vol. 62, no. 5, pp. 2140-2155, June 2013, is rigorously proved to be globally optimal. Then, we turn to the case of partial eavesdropper's CSI (ECSI), where the uncertainty of ECSI is characterized as a bounded region, and study the worst-case secrecy rate maximization (WCSRM) problem. Different from the common spherical uncertainty region, the uncertainty region adopted in our paper imposes independent constraints on the channel gain and direction. With the proposed uncertainty region, we give an in-depth analysis of the WCSRM problem. We solve the rank-1 relay beamformer in an explicit form and move a step further by establishing the sufficient conditions for the global optimality of the rank-1 solution. Besides, the rank-2 relay beamformer with a special singular value decomposition (SVD) structure is also considered. By reducing the optimization variables into single variable, we show that the proposed rank-2 solution can be solved by simple line search. The asymptotic optimality of the proposed rank-2 relay beamformer in the high relay power region is also proved under mild conditions. Finally, numerical results are presented to verify the analysis in the paper.

IEEE Transactions on Signal Processing•Nov 13, 2015•22 citations

Secure Relay Beamforming with Correlated Channel Models in Dual-Hop Wireless Communication Networks

Zhenhua Yuan, Chen Chen, Lin Bai +2 more

In this article, the authors focus on a correlated channel model for secure relay beamforming in the relayeavesdropper network. In this network, a single-antenna sourcedestination pair transmits secure information with the help of a amplify-and-forward (AF) relay equipped with multiple antennas. The relay cannot obtain the instantaneous channel state information (CSI) of the eavesdropper. The relay only have the knowledge of correlation information between the legitimate and eavesdropping channels. Depending on this information, we derived the conditional distribution of the eavesdropping channel. Three beamformers at the relay are studied: the zero-forcing (ZF) beamformer, the generalized match-forward (GMF) beamformer and the general-rank beamformer (GRBF). The authors found that the ZF beamformer is invalid in this system, and the GMF beamformer is the optimal rank-1 beamformer, and the GRBF is the iteratively optimal beamformer. Numerical results are presented to illustrate three beamformers' performance, and the impacts of different parameters, especially the channel correlation, on the system performance are analyzed.

Globecom•Dec 1, 2016•3 citations

Robust Beamforming and Jamming for Secure AF Relay Networks with Multiple Eavesdroppers

Cong Zhang, Hui Gao, Haijing Liu +1 more

In this paper, we study the secrecy transmission in multi-antenna relay networks with multiple eavesdroppers. The relay employs the amplify-and-forward relaying protocol and simultaneously sends the artificial noise to interfere the eavesdroppers. It is assumed that only imperfect channel state information on the main and eavesdropping channels is available at the relay. We exploit the robust beam forming and jamming to maximize the worst-case secrecy rate under a total relay power budget. Because of the infinitely nonconvex constraints, the problem is difficult to solve. Therefore, we approximate the problem into several tractable semi definite programs by semi definite relaxation, S-procedure, and the successive convex approximation techniques. Simulation results show the effectiveness of the proposed scheme.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2014•13 citations

Correlated channel model-based secure communications in dual-hop wireless communication networks

Zhenhua Yuan, Chen Chen, Xiang Cheng +3 more

This article is focused on secure relay beamformer design with a correlated channel model in the relay-eavesdropper network. In this network, a single-antenna source-destination pair transmits secure information with the help of an amplify-and-forward (AF) relay equipped with multiple antennas, and the legitimate and eavesdropping channels are correlated. The relay cannot obtain the instantaneous channel state information (CSI) of the eavesdropper, and has only the knowledge of correlation information between the legitimate and eavesdropping channels. Depending on this information, we derive the conditional distribution of the eavesdropping channel. Two beamformers at the relay are studied for the approximate ergodic secrecy rate: (1) the generalized match-and-forward (GMF) beamformer to maximize the legitimate channel rate, and (2) the general-rank beamformer (GRBF). In addition, one lower-bound-maximizing (LBM) beamformer at the relay is discussed for maximizing the lower bound of the ergodic secrecy rate. We find that the GMF beamformer is the optimal rank-one beamformer, that the GRBF is the iteratively optimal beamformer, and that the performance of the LBM beamformer for the ergodic secrecy rate gets close to that of the GRBF for the approximate secrecy rate. It can also be observed that when the relay has lower power or the channel gain of the second hop is low, the performance of the GMF beamformer surpasses that of the GRBF. Numerical results are presented to illustrate the beamformers’ performance.

Frontiers of Information Technology & Electronic Engineering•Jun 1, 2017•5 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
In this paper, we study the robust relay beamformer design problem in the relay-eavesdropper network with imperfect knowledge of the eavesdropper's channel. In this network, the half-duplexing relay is equipped with multiple antennas and employs the amplify-and-forward (AF) relaying protocol. Assuming static legitimate links, we consider the relay beamforming problem under two models for the eavesdropper's channel: 1) the Rician fading channel model, where only statistical information of the eavesdropper's channel is known by the legitimate nodes; and 2) the deterministic uncertainty model, where the uncertainty region of the eavesdropper's channel vector is modeled as a sphere. As for the optimization criteria, we use an approximation of the ergodic secrecy rate under the Rician fading model and the worst-case secrecy rate under the deterministic uncertainty model. Under both models, the optimal rank-1, match-and-forward (MF), and zero-forcing (ZF) beamformers are developed, and the equivalence of the optimal rank-1 beamformer and the optimal MF beamformer is also established. Under the Rician fading model, it is shown that the optimal ZF beamformer may have a rank greater than 1 and, therefore, could outperform the optimal MF beamformer, whereas under the deterministic uncertainty model, the optimal ZF beamformer must be rank-1. Numerical results are presented to verify the effectiveness of the proposed relay beamformers.
The problem of robust relay beamforming for the multiple-antenna amplify-and-forward (AF) relay network in the presence of an eavesdropper is studied in the paper, with the partial eavesdropper's channel side information (ECSI) scenario being considered. In our work, the uncertainty of ECSI is modeled by using a bounded region, which imposes independent constraints on the channel gain and direction. We propose a new rank-2 relay beamformer with a special singular value decomposition (SVD) structure, whose optimal solution for the worst-case secrecy rate maximization problem can be derived via simple line searching. Furthermore, the asymptotic optimality of the proposed rank-2 beamformer is proved in the high-relay-power region under certain condition, with the performance of the proposed beamformer being verified by using numerical experiments.
In this paper, we investigate the secure relay beamforming problems for the amplify-and-forward (AF) relay network, where the transmitter sends the information to the receiver with the help of a multiple-antenna relay in the presence of an eavesdropper. We first study the secrecy rate maximization (SRM) problem in the case of complete channel state information (CSI). The rank-1 relay beamformer, which has been solved in our previous work in “Secure relay beamforming with imperfect channel side information,” IEEE Trans. Veh. Technol., vol. 62, no. 5, pp. 2140-2155, June 2013, is rigorously proved to be globally optimal. Then, we turn to the case of partial eavesdropper's CSI (ECSI), where the uncertainty of ECSI is characterized as a bounded region, and study the worst-case secrecy rate maximization (WCSRM) problem. Different from the common spherical uncertainty region, the uncertainty region adopted in our paper imposes independent constraints on the channel gain and direction. With the proposed uncertainty region, we give an in-depth analysis of the WCSRM problem. We solve the rank-1 relay beamformer in an explicit form and move a step further by establishing the sufficient conditions for the global optimality of the rank-1 solution. Besides, the rank-2 relay beamformer with a special singular value decomposition (SVD) structure is also considered. By reducing the optimization variables into single variable, we show that the proposed rank-2 solution can be solved by simple line search. The asymptotic optimality of the proposed rank-2 relay beamformer in the high relay power region is also proved under mild conditions. Finally, numerical results are presented to verify the analysis in the paper.
In this article, the authors focus on a correlated channel model for secure relay beamforming in the relayeavesdropper network. In this network, a single-antenna sourcedestination pair transmits secure information with the help of a amplify-and-forward (AF) relay equipped with multiple antennas. The relay cannot obtain the instantaneous channel state information (CSI) of the eavesdropper. The relay only have the knowledge of correlation information between the legitimate and eavesdropping channels. Depending on this information, we derived the conditional distribution of the eavesdropping channel. Three beamformers at the relay are studied: the zero-forcing (ZF) beamformer, the generalized match-forward (GMF) beamformer and the general-rank beamformer (GRBF). The authors found that the ZF beamformer is invalid in this system, and the GMF beamformer is the optimal rank-1 beamformer, and the GRBF is the iteratively optimal beamformer. Numerical results are presented to illustrate three beamformers' performance, and the impacts of different parameters, especially the channel correlation, on the system performance are analyzed.
In this paper, we study the secrecy transmission in multi-antenna relay networks with multiple eavesdroppers. The relay employs the amplify-and-forward relaying protocol and simultaneously sends the artificial noise to interfere the eavesdroppers. It is assumed that only imperfect channel state information on the main and eavesdropping channels is available at the relay. We exploit the robust beam forming and jamming to maximize the worst-case secrecy rate under a total relay power budget. Because of the infinitely nonconvex constraints, the problem is difficult to solve. Therefore, we approximate the problem into several tractable semi definite programs by semi definite relaxation, S-procedure, and the successive convex approximation techniques. Simulation results show the effectiveness of the proposed scheme.
This article is focused on secure relay beamformer design with a correlated channel model in the relay-eavesdropper network. In this network, a single-antenna source-destination pair transmits secure information with the help of an amplify-and-forward (AF) relay equipped with multiple antennas, and the legitimate and eavesdropping channels are correlated. The relay cannot obtain the instantaneous channel state information (CSI) of the eavesdropper, and has only the knowledge of correlation information between the legitimate and eavesdropping channels. Depending on this information, we derive the conditional distribution of the eavesdropping channel. Two beamformers at the relay are studied for the approximate ergodic secrecy rate: (1) the generalized match-and-forward (GMF) beamformer to maximize the legitimate channel rate, and (2) the general-rank beamformer (GRBF). In addition, one lower-bound-maximizing (LBM) beamformer at the relay is discussed for maximizing the lower bound of the ergodic secrecy rate. We find that the GMF beamformer is the optimal rank-one beamformer, that the GRBF is the iteratively optimal beamformer, and that the performance of the LBM beamformer for the ergodic secrecy rate gets close to that of the GRBF for the approximate secrecy rate. It can also be observed that when the relay has lower power or the channel gain of the second hop is low, the performance of the GMF beamformer surpasses that of the GRBF. Numerical results are presented to illustrate the beamformers’ performance.
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.