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)

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

Weichen Wang, Ruohan Cao, Hui Gao, Tiejun Lv

Published Nov 1, 2016• 1 citation
Publisher

Abstract

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.

DOI
10.1109/milcom.2016.7795491

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

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

Optimal Power Allocation for Physical Layer Security in Multi-Hop DF Relay Networks

Jong-Ho Lee

In this paper, we consider secure communications of one source-destination pair in wireless multi-hop decode-and-forward (DF) relay networks. In the presence of an eavesdropper, we derive an optimal power allocation strategy to maximize achievable secrecy rates under an overall transmit power constraint assuming that a single relay is located at each individual hop. We demonstrate that the optimal power allocation is obtained when the overall power constraint and the DF-relaying constraints necessary to guarantee that each DF relay correctly decodes the information signals hold with equality, which rely on channel conditions between the source, relays, and destination. The channel conditions for the eavesdropper are shown to only influence relays that may be inactive for secrecy rate maximization. We also consider multiple cooperative relays at each hop to perform cooperative beamforming in the presence of multiple eavesdroppers. To improve the secrecy rate in multi-hop relay networks, which include more than two hops, we propose an iterative cooperative beamformer design and transmit power allocation scheme with relay selection. Numerical results are presented to investigate the secrecy capacity obtained by the optimal power allocation in multi-hop DF relay networks and to confirm the secrecy rate enhancement of the proposed cooperative beamforming scheme.

IEEE Transactions on Wireless Communications•Aug 13, 2015•48 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

MIMO decode-and-forward relay beamforming for secrecy with cooperative jamming

Sanjay Vishwakarma, A. Chockalingam

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers PSand PR, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

National Conference on Communications•Feb 1, 2014•8 citations

Secrecy rate maximization in full-duplex multi-antenna decode-and-forward relay systems

Batu K. Chalise, Wing‐Kin Ma, Himal A. Suraweera +1 more

This paper proposes optimum beamforming for a system consisting of a source, a full-duplex (FD) relay, an intended destination, and an eavesdropper. The source and destination are single-antenna nodes, whereas the FD relay is a multi-antenna node. Our objective is to find the optimum receive and transmit beamformers at the relay so that the secrecy rate is maximized. The joint optimization problem is equivalently expressed in terms of the transmit beamformer. The resulting optimization is non-convex. However, we equivalently reformulate it to a suitable form so that the optimum solution is obtained by solving semi-definite relaxation problem, in conjunction with a line search confined to a specific region. Computer simulations demonstrate significant increase in secrecy rate compared to the conventional secure half-duplex relay communications.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jul 1, 2017•4 citations
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.
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.
In this paper, we consider secure communications of one source-destination pair in wireless multi-hop decode-and-forward (DF) relay networks. In the presence of an eavesdropper, we derive an optimal power allocation strategy to maximize achievable secrecy rates under an overall transmit power constraint assuming that a single relay is located at each individual hop. We demonstrate that the optimal power allocation is obtained when the overall power constraint and the DF-relaying constraints necessary to guarantee that each DF relay correctly decodes the information signals hold with equality, which rely on channel conditions between the source, relays, and destination. The channel conditions for the eavesdropper are shown to only influence relays that may be inactive for secrecy rate maximization. We also consider multiple cooperative relays at each hop to perform cooperative beamforming in the presence of multiple eavesdroppers. To improve the secrecy rate in multi-hop relay networks, which include more than two hops, we propose an iterative cooperative beamformer design and transmit power allocation scheme with relay selection. Numerical results are presented to investigate the secrecy capacity obtained by the optimal power allocation in multi-hop DF relay networks and to confirm the secrecy rate enhancement of the proposed cooperative beamforming scheme.
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.
In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers PSand PR, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.
This paper proposes optimum beamforming for a system consisting of a source, a full-duplex (FD) relay, an intended destination, and an eavesdropper. The source and destination are single-antenna nodes, whereas the FD relay is a multi-antenna node. Our objective is to find the optimum receive and transmit beamformers at the relay so that the secrecy rate is maximized. The joint optimization problem is equivalently expressed in terms of the transmit beamformer. The resulting optimization is non-convex. However, we equivalently reformulate it to a suitable form so that the optimum solution is obtained by solving semi-definite relaxation problem, in conjunction with a line search confined to a specific region. Computer simulations demonstrate significant increase in secrecy rate compared to the conventional secure half-duplex relay communications.