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

ETRI Journal

Cooperative Decode-and-Forward Relaying for Secure Multicasting

Jong-Ho Lee, Illsoo Sohn, Sungju Song, Yong‐Hwa Kim

Published Jun 1, 2016• 0 citations
Publisher

Abstract

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.

DOI
10.4218/etrij.16.0115.1029

Related papers

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

Jong-Ho Lee

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.

IEEE Transactions on Communications•Jan 1, 2016•10 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•9 citations

Cooperative Secure Beamforming for AF Relay Networks With Multiple Eavesdroppers

Ye Yang, Qiang Li, Wing‐Kin Ma +2 more

This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.

IEEE Signal Processing Letters•Nov 20, 2012•174 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

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•49 citations

Combined relay selection and secure beamforming for decode-and-forward networks with multiple eavesdroppers

Zhongjian Liu, Xiaoning Zhang, Chen Chen +1 more

In this paper, we investigate a two-stage cooperative network consisting of one source, one corresponding destination, multiple eavesdroppers, and several intermediate nodes. In the first stage, the source selects several relays from the intermediate nodes and broadcasts its message to them. In the second stage, the selected nodes operating as the decode-and-forward (DF) relays perform collaborative beamforming for the secure data transmission that prevents eavesdropping. We study the relay selection and secure beamforming problem considering both the achievable rate in the first stage and the secrecy rate constraint in the second stage, whereas the existing works leave out of the transmission in the first stage. We propose two combined relay selection and beamforming schemes. The first scheme is to maximize the secrecy rate of the relay selection and beamforming with the achievable rate constraint in the first stage. To reduce the complexity of the first scheme, the second scheme combines relay selection and a suboptimal secure beamforming scheme, in which we hypothesize a virtual eavesdropper instead of all eavesdroppers and maximize the secrecy rate according to the virtual eavesdropper. Simulation results show that the performance of our first scheme is the same as that of the exhaustive search scheme, and the second scheme significantly reduces the complexity with acceptable performance degradation.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2013•5 citations
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 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, 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 letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.
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.
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.
In this paper, we investigate a two-stage cooperative network consisting of one source, one corresponding destination, multiple eavesdroppers, and several intermediate nodes. In the first stage, the source selects several relays from the intermediate nodes and broadcasts its message to them. In the second stage, the selected nodes operating as the decode-and-forward (DF) relays perform collaborative beamforming for the secure data transmission that prevents eavesdropping. We study the relay selection and secure beamforming problem considering both the achievable rate in the first stage and the secrecy rate constraint in the second stage, whereas the existing works leave out of the transmission in the first stage. We propose two combined relay selection and beamforming schemes. The first scheme is to maximize the secrecy rate of the relay selection and beamforming with the achievable rate constraint in the first stage. To reduce the complexity of the first scheme, the second scheme combines relay selection and a suboptimal secure beamforming scheme, in which we hypothesize a virtual eavesdropper instead of all eavesdroppers and maximize the secrecy rate according to the virtual eavesdropper. Simulation results show that the performance of our first scheme is the same as that of the exhaustive search scheme, and the second scheme significantly reduces the complexity with acceptable performance degradation.