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 Military Communications Conference (MILCOM)

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

Weichen Wang, Ruohan Cao, Hui Gao, Tiejun Lv

Published Nov 1, 2016• 0 citations
Publisher

Abstract

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.

DOI
10.1109/milcom.2016.7795385

Related papers

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

Weichen Wang, Tiejun Lv, Hui Gao

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.

IEEE Access•Jan 1, 2016•7 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 Design for Secrecy in Multiuser Peer-to-Peer Wireless Relay Networks

Xiangwu Gong, Hao Yin, Feihong Dong +2 more

In this paper, physical layer security is studied for multiuser peer-to-peer (MUP2P) relay networks using amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with an eavesdropper. Though the beamforming design has been previously investigated with perfect channel state information (CSI) in the presence of an eavesdropper, this paper focuses on researching the robust relay beamforming mechanism for MUP2P relay networks. The worst-case secrecy rate is maximized, while subject to the worst-case signal-to-interference-noise ratio constraint at each user and the total power constraint at relays under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Mathematically, the optimization problem is nonlinear and nonconvex. We propose an iterative algorithm to obtain an efficient solution of the nonconvex problem by employing S-Procedure and rank relaxation techniques. The convergence of the proposed robust algorithm is proved and its complexity is analyzed. Simulations show that the proposed design can significantly improve the performance of secure wireless communications.

IEEE Systems Journal•Jul 26, 2016•9 citations

Joint Beamforming and Power Allocation for Secrecy in Peer-to-Peer Relay Networks

Chao Wang, Hui‐Ming Wang, Derrick Wing Kwan Ng +2 more

This paper investigates the physical-layer security of a multiuser peer-to-peer (MUP2P) relay network for amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with a multi-antenna eavesdropper and the eavesdropper can wiretap the confidential information in both two cooperative phases. Our goal is to optimize the transmit power of the source and the beamforming weights of the relays jointly for secrecy rate maximization subject to the minimum signal-to-interference-noise-ratio (SINR) constraint at each user, and the individual and total power constraints. Mathematically, the optimization problem is non-linear and non-convex, which does not facilitate an efficient resource allocation algorithm design. As an alternative, a null space beamforming scheme is adopted at the relays for simplifying the joint optimization and eliminating the confidential information leakage in the second cooperative phase, where the relay beamforming vector lies in the null space of the equivalent channel of the relay to eavesdropper links. Although the null space beamforming scheme simplifies the design of resource allocation algorithm, the considered problem is still non-convex and obtaining the global optimum is very difficult, if not impossible. Employing a sequential parametric convex approximation (SPCA) method, we propose an iterative algorithm to obtain an efficient solution of the non-convex problem. Besides, the proposed joint design algorithm requires a feasible starting point, we also propose a low complexity feasible initial points searching algorithm. Simulations demonstrate the validity of the proposed strategy.

IEEE Transactions on Wireless Communications•Feb 13, 2015•88 citations
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 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 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, physical layer security is studied for multiuser peer-to-peer (MUP2P) relay networks using amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with an eavesdropper. Though the beamforming design has been previously investigated with perfect channel state information (CSI) in the presence of an eavesdropper, this paper focuses on researching the robust relay beamforming mechanism for MUP2P relay networks. The worst-case secrecy rate is maximized, while subject to the worst-case signal-to-interference-noise ratio constraint at each user and the total power constraint at relays under a bounded spherical region for the norm of the CSI error vector from the relays to the destination. Mathematically, the optimization problem is nonlinear and nonconvex. We propose an iterative algorithm to obtain an efficient solution of the nonconvex problem by employing S-Procedure and rank relaxation techniques. The convergence of the proposed robust algorithm is proved and its complexity is analyzed. Simulations show that the proposed design can significantly improve the performance of secure wireless communications.
This paper investigates the physical-layer security of a multiuser peer-to-peer (MUP2P) relay network for amplify-and-forward (AF) protocol, where a secure user and other unclassified users coexist with a multi-antenna eavesdropper and the eavesdropper can wiretap the confidential information in both two cooperative phases. Our goal is to optimize the transmit power of the source and the beamforming weights of the relays jointly for secrecy rate maximization subject to the minimum signal-to-interference-noise-ratio (SINR) constraint at each user, and the individual and total power constraints. Mathematically, the optimization problem is non-linear and non-convex, which does not facilitate an efficient resource allocation algorithm design. As an alternative, a null space beamforming scheme is adopted at the relays for simplifying the joint optimization and eliminating the confidential information leakage in the second cooperative phase, where the relay beamforming vector lies in the null space of the equivalent channel of the relay to eavesdropper links. Although the null space beamforming scheme simplifies the design of resource allocation algorithm, the considered problem is still non-convex and obtaining the global optimum is very difficult, if not impossible. Employing a sequential parametric convex approximation (SPCA) method, we propose an iterative algorithm to obtain an efficient solution of the non-convex problem. Besides, the proposed joint design algorithm requires a feasible starting point, we also propose a low complexity feasible initial points searching algorithm. Simulations demonstrate the validity of the proposed strategy.