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 Access

Robust Beamforming and Power Allocation for Secrecy in DF Relay Networks With Imperfect Channel State Information

Weichen Wang, Tiejun Lv, Hui Gao

Published Jan 1, 2016• 7 citations
Publisher

Abstract

We address a robust beamforming design and power allocation problem for a one-way multi-antenna relay network, where the multi-antenna source implements communication with the multi-antenna destination via a decode-and-forward (DF) relay in the presence of the multiple single-antenna eavesdroppers. The eavesdroppers can only overhear the information flowed from the relay to the destination in the second hop. We aim to maximize the worst-case secrecy rate in the condition that the global channel state information (CSI) is imperfect. To this end, we propose the joint beamforming and power allocation design for the worst-case secrecy rate maximization. However, our proposed design constitutes a non-convex problem, which involves an infinite number of constraints because of the imperfect CSI. To make the problem more tractable, we approximate the problem into several tractablesemidefinite programs by semidefinite relaxation, successive convex approximation, and S-procedure techniques, and we propose an iterative algorithm to solve the problem. Furthermore, we show that the proposed algorithm is also applicable for the case the Gaussian wiretap model, where only the eavesdroppers' CSI is imperfect. Simulation results validate the effectiveness of the proposed algorithm.

DOI
10.1109/access.2017.2649568

Related papers

Robust beamforming and power allocation for secrecy in multi-pair decode-and-forward relay networks

Weichen Wang, Ruohan Cao, Hui Gao +1 more

We address a robust beamforming design and power allocation problem for a multi-pair one-way relay network, where the single-antenna users of each pair implement communication via a decode-and-forward multi-antenna relay. In this network, a secure user and other unclassified users coexist with a multi-antenna eavesdropper, and only the imperfect eavesdropper's channel state information (ECSI) is available. We aim to maximize the worst-case secrecy rate of the secure user while guaranteeing the quality of service of the unclassified users with a total power constraint. Motivated by this challenge, we explore the beamforming design and power allocation among the sources and the relay with the channel matrix error. Unfortunately, the proposed design constitutes a non-convex problem, which involves an infinite number of constraints because of the imperfect ECSI. To this end, we propose an efficient algorithm by using the techniques of semidefinite relaxation, successive convex approximation and S-procedure techniques. Following a similar optimization framework, we further investigate the scheme with the channel covariance matrix error. Simulation results validate the effectiveness of the proposed algorithm.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2016•0 citations

Secure beamforming and power allocation for multi-pair decode-and-forward relay networks

Weichen Wang, Ruohan Cao, Hui Gao +1 more

We study secrecy communication for a multi-pair decode-and-forward (DF) relay network (MP-DFRN), where one of the singe-antenna sources is wiretapped by a single-antenna eavesdropper. In particular, we aim to maximize the secrecy rate of the secure source while guaranteeing the quality of service (QoS) at the destinations with a total power constraint. The optimization requires a joint beamforming and power allocation at the multi-antenna relay, and this problem turns out to be non-convex. To this end, an efficient algorithm is proposed by using the techniques of successive convex approximation and constrained concave convex procedure. Following a similar optimization framework, we further investigate the transmit power minimization problem with secrecy and QoS constraints. Our study suggests a new and efficient framework to achieve secrecy communication in the MP-DFRN, and also reveals the interplay between the achievable secrecy rate and the total power budget.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2016•1 citation

Robust joint beamforming and artificial noise design for amplify-and-forward multi-antenna relay systems

Lijian Zhang, Liang Jin, Wenyu Luo +2 more

In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.

IEEE International Conference on Acoustics Speech and Signal Processing•Apr 1, 2015•4 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

Robust beamforming and cooperative jamming for secure transmission in DF relay systems

Bin Li, Zesong Fei

In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.

EURASIP Journal on Wireless Communications and Networking•Mar 1, 2016•11 citations

Decode-and-forward relay beamforming for secrecy with imperfect CSI and multiple eavesdroppers

Sanjay Vishwakarma, A. Chockalingam

In this paper, we evaluate secrecy rates in cooperative relay beamforming in the presence of imperfect channel state information (CSI) and multiple eavesdroppers. A source-destination pair aided by k out of M relays, 1 ≤ k ≤ M, using decode-and-forward relay beamforming is considered. We compute the worst case secrecy rate with imperfect CSI in the presence of multiple eavesdroppers, where the number of eavesdroppers can be more than the number of relays. We solve the optimization problem for all possible relay combinations to find the secrecy rate and optimum source and relay weights subject to a total power constraint. We relax the rank-1 constraint on the complex semi-definite relay weight matrix and use S-procedure to reformulate the optimization problem that can be solved using convex semi-definite programming.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2012•11 citations
We address a robust beamforming design and power allocation problem for a one-way multi-antenna relay network, where the multi-antenna source implements communication with the multi-antenna destination via a decode-and-forward (DF) relay in the presence of the multiple single-antenna eavesdroppers. The eavesdroppers can only overhear the information flowed from the relay to the destination in the second hop. We aim to maximize the worst-case secrecy rate in the condition that the global channel state information (CSI) is imperfect. To this end, we propose the joint beamforming and power allocation design for the worst-case secrecy rate maximization. However, our proposed design constitutes a non-convex problem, which involves an infinite number of constraints because of the imperfect CSI. To make the problem more tractable, we approximate the problem into several tractablesemidefinite programs by semidefinite relaxation, successive convex approximation, and S-procedure techniques, and we propose an iterative algorithm to solve the problem. Furthermore, we show that the proposed algorithm is also applicable for the case the Gaussian wiretap model, where only the eavesdroppers' CSI is imperfect. Simulation results validate the effectiveness of the proposed algorithm.
We address a robust beamforming design and power allocation problem for a multi-pair one-way relay network, where the single-antenna users of each pair implement communication via a decode-and-forward multi-antenna relay. In this network, a secure user and other unclassified users coexist with a multi-antenna eavesdropper, and only the imperfect eavesdropper's channel state information (ECSI) is available. We aim to maximize the worst-case secrecy rate of the secure user while guaranteeing the quality of service of the unclassified users with a total power constraint. Motivated by this challenge, we explore the beamforming design and power allocation among the sources and the relay with the channel matrix error. Unfortunately, the proposed design constitutes a non-convex problem, which involves an infinite number of constraints because of the imperfect ECSI. To this end, we propose an efficient algorithm by using the techniques of semidefinite relaxation, successive convex approximation and S-procedure techniques. Following a similar optimization framework, we further investigate the scheme with the channel covariance matrix error. Simulation results validate the effectiveness of the proposed algorithm.
We study secrecy communication for a multi-pair decode-and-forward (DF) relay network (MP-DFRN), where one of the singe-antenna sources is wiretapped by a single-antenna eavesdropper. In particular, we aim to maximize the secrecy rate of the secure source while guaranteeing the quality of service (QoS) at the destinations with a total power constraint. The optimization requires a joint beamforming and power allocation at the multi-antenna relay, and this problem turns out to be non-convex. To this end, an efficient algorithm is proposed by using the techniques of successive convex approximation and constrained concave convex procedure. Following a similar optimization framework, we further investigate the transmit power minimization problem with secrecy and QoS constraints. Our study suggests a new and efficient framework to achieve secrecy communication in the MP-DFRN, and also reveals the interplay between the achievable secrecy rate and the total power budget.
In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.
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.
In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.
In this paper, we evaluate secrecy rates in cooperative relay beamforming in the presence of imperfect channel state information (CSI) and multiple eavesdroppers. A source-destination pair aided by k out of M relays, 1 ≤ k ≤ M, using decode-and-forward relay beamforming is considered. We compute the worst case secrecy rate with imperfect CSI in the presence of multiple eavesdroppers, where the number of eavesdroppers can be more than the number of relays. We solve the optimization problem for all possible relay combinations to find the secrecy rate and optimum source and relay weights subject to a total power constraint. We relax the rank-1 constraint on the complex semi-definite relay weight matrix and use S-procedure to reformulate the optimization problem that can be solved using convex semi-definite programming.