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 Wireless Communications and Networking Conference

Decode-and-Forward based strategies for secrecy in multiple-relay networks

Raef Bassily, Şennur Ulukuş

Published Apr 1, 2012• 1 citation
Publisher

Abstract

In this paper, we first study the Decode-and-Forward strategy for secrecy in a single-relay network. We propose a suboptimal Decode-and-Forward with Zero Forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF. The first strategy is a single-hop strategy in which all the relays decode the source message at the same time, then perform beamforming such that all the relays' signals are eliminated from the eavesdropper's observation (full zero-forcing). We give the achievable rate by this strategy and derive the optimal power control policy. We show that, in this strategy, the relays which are far from the source create a bottleneck and limit the achievable rate. The second strategy is a multiple hop strategy that overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial zero-forcing only, assuming that all the relays are required to transmit fresh information in every transmission block. The third strategy is also a multiple hop strategy in which full zero-forcing is possible and the rate achieved does not suffer from the drawback of the first strategy.

DOI
10.1109/wcnc.2012.6214518

Related papers

Secure communication in multiple relay networks through decode-and-forward strategies

Raef Bassily, Şennur Ulukuş

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decode-and-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

Journal of Communications and Networks•Aug 1, 2012•32 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

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

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

Secure Communication for Amplify-and-Forward Relay Networks With Finite Alphabet Input

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.

IEEE Transactions on Information Forensics and Security•Mar 21, 2018•12 citations

Decode-and-Forward Relay Beamforming for Secrecy with Finite-Alphabet Input

Sanjay Vishwakarma, A. Chockalingam

In this letter, we compute the secrecy rate of decode-and-forward (DF) relay beamforming with finite input alphabet of size M. Source and relays operate under a total power constraint. First, we observe that the secrecy rate with finite-alphabet input can go to zero as the total power increases, when we use the source power and the relay weights obtained assuming Gaussian input. This is because the capacity of an eavesdropper can approach the finite-alphabet capacity of \frac{1}{2}\log_2 M with increasing total power, due to the inability to completely null in the direction of the eavesdropper. We then propose a transmit power control scheme where the optimum source power and relay weights are obtained by carrying out transmit power (source power plus relay power) control on DF with Gaussian input using semi-definite programming, and then obtaining the corresponding source power and relay weights which maximize the secrecy rate for DF with finite-alphabet input. The proposed power control scheme is shown to achieve increasing secrecy rates with increasing total power with a saturation behavior at high total powers.

IEEE Communications Letters•Apr 11, 2013•18 citations
In this paper, we first study the Decode-and-Forward strategy for secrecy in a single-relay network. We propose a suboptimal Decode-and-Forward with Zero Forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF. The first strategy is a single-hop strategy in which all the relays decode the source message at the same time, then perform beamforming such that all the relays' signals are eliminated from the eavesdropper's observation (full zero-forcing). We give the achievable rate by this strategy and derive the optimal power control policy. We show that, in this strategy, the relays which are far from the source create a bottleneck and limit the achievable rate. The second strategy is a multiple hop strategy that overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial zero-forcing only, assuming that all the relays are required to transmit fresh information in every transmission block. The third strategy is also a multiple hop strategy in which full zero-forcing is possible and the rate achieved does not suffer from the drawback of the first strategy.
In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decode-and-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical 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.
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.
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.
This paper considers secure communication for amplify-and-forward (AF) relay networks with finite alphabet input. The joint optimization of power selection and beamforming design for improving the physical layer security of AF relay networks with single and multiple eavesdroppers is investigated. For the case with one eavesdropper, we transform the problem of multi-variable beamforming design into a single-variable optimization problem through semi-definite programming and solve it with one-dimensional optimization techniques. Moreover, the corresponding source power is obtained by utilizing the relation between the mutual information and minimum mean square error. Then, an iterative two-step algorithm is proposed to maximize the achievable secrecy rate. In the presence of multiple eavesdroppers, a zero-forcing beamforming scheme, where the confidential signal is nulled out in the direction of all eavesdroppers, is proposed to enhance the physical layer security. We decouple the source power and the beamforming vector by transforming the achievable secrecy rate into a single-variable function of the source power. Then, the suboptimal source power and the corresponding beamforming vector with low-complexity are derived. Numerical examples show that the proposed schemes significantly enhance the secrecy performance of the AF relay networks.
In this letter, we compute the secrecy rate of decode-and-forward (DF) relay beamforming with finite input alphabet of size M. Source and relays operate under a total power constraint. First, we observe that the secrecy rate with finite-alphabet input can go to zero as the total power increases, when we use the source power and the relay weights obtained assuming Gaussian input. This is because the capacity of an eavesdropper can approach the finite-alphabet capacity of \frac{1}{2}\log_2 M with increasing total power, due to the inability to completely null in the direction of the eavesdropper. We then propose a transmit power control scheme where the optimum source power and relay weights are obtained by carrying out transmit power (source power plus relay power) control on DF with Gaussian input using semi-definite programming, and then obtaining the corresponding source power and relay weights which maximize the secrecy rate for DF with finite-alphabet input. The proposed power control scheme is shown to achieve increasing secrecy rates with increasing total power with a saturation behavior at high total powers.