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 Communications

Confidential Multicasting Assisted by Multi-Hop Multi-Antenna DF Relays in the Presence of Multiple Eavesdroppers

Jong-Ho Lee

Published Jan 1, 2016• 10 citations
Publisher

Abstract

In this paper, we consider confidential multicasting in multi-hop multi-antenna decode-and-forward (DF) relay networks, where a source sends a secure common message to multiple destinations in the presence of multiple eavesdroppers with the help of a multi-antenna DF relay located at each hop. Under an overall power constraint, we first show that the optimization problem for relay beamformer design and power allocation to maximize the achievable multicast secrecy rate in a two-hop multi-antenna relay network can be solved by using semidefinite relaxation and bisection technique. Further, we also propose a suboptimal iterative sequential update scheme for a multi-hop relay network including more than two hops. At each iteration, the relay beamformer at each hop is updated sequentially by solving an extended generalized eigenvector problem for a multiple-destination multiple-eavesdropper case, and the power allocation is updated by using the bisection technique with the feasibility problem of linear programming. Numerical results are presented to verify the multicast secrecy rates achieved by the proposed schemes in multi-hop multi-antenna DF relay networks.

DOI
10.1109/tcomm.2016.2600676

Related papers

Cooperative Decode-and-Forward Relaying for Secure Multicasting

Jong-Ho Lee, Illsoo Sohn, Sungju Song +1 more

In this paper, secure multicasting with the help of cooperative decode-and-forward relays is considered for the case in which a source securely sends a common message to multiple destinations in the presence of a single eavesdropper. We show that the secrecy rate maximization problem in the secure multicasting scenario under an overall power constraint can be solved using semidefinite programing with semidefinite relaxation and a bisection technique. Further, a suboptimal approach using zero-forcing beamforming and linear programming based power allocation is also proposed. Numerical results illustrate the secrecy rates achieved by the proposed schemes under secure multicasting scenarios.

ETRI Journal•Jun 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

Cooperative Beamformer Design for Improving Physical Layer Security in Multi-Hop Decode-and-Forward Relay Networks

Han-Byul Lee, Jong-Ho Lee, Seong-Cheol Kim

In this paper, we consider secure communications in multi-hop relaying systems, where multiple decode-and-forward (DF) relays are located at each individual hop and perform cooperative beamforming to improve physical layer security.In order to determine the cooperative relay beamformer at each hop, we propose an iterative beamformer update scheme using semidefinite relaxation and bisection techniques.Numerical results are presented to verify the secrecy rate performance of the proposed scheme.

KSII Transactions on Internet and Information Systems•Jan 31, 2016•0 citations

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

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

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
In this paper, we consider confidential multicasting in multi-hop multi-antenna decode-and-forward (DF) relay networks, where a source sends a secure common message to multiple destinations in the presence of multiple eavesdroppers with the help of a multi-antenna DF relay located at each hop. Under an overall power constraint, we first show that the optimization problem for relay beamformer design and power allocation to maximize the achievable multicast secrecy rate in a two-hop multi-antenna relay network can be solved by using semidefinite relaxation and bisection technique. Further, we also propose a suboptimal iterative sequential update scheme for a multi-hop relay network including more than two hops. At each iteration, the relay beamformer at each hop is updated sequentially by solving an extended generalized eigenvector problem for a multiple-destination multiple-eavesdropper case, and the power allocation is updated by using the bisection technique with the feasibility problem of linear programming. Numerical results are presented to verify the multicast secrecy rates achieved by the proposed schemes in multi-hop multi-antenna DF relay networks.
In this paper, secure multicasting with the help of cooperative decode-and-forward relays is considered for the case in which a source securely sends a common message to multiple destinations in the presence of a single eavesdropper. We show that the secrecy rate maximization problem in the secure multicasting scenario under an overall power constraint can be solved using semidefinite programing with semidefinite relaxation and a bisection technique. Further, a suboptimal approach using zero-forcing beamforming and linear programming based power allocation is also proposed. Numerical results illustrate the secrecy rates achieved by the proposed schemes under secure multicasting scenarios.
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.
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.
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.
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.