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 International Conference on Communication Systems (ICCS)

Adaptive distributed beamforming and jamming in DF relay networks for physical layer secrecy

Chengmin Gu, Chao Zhang

Published Dec 1, 2016• 3 citations
Publisher

Abstract

In this paper, we propose a joint distributed beamforming and jamming scheme in decode-and-forward (DF) relay networks to physical layer secrecy. Considering the special property of DF relay networks, where only the relays decoding the message from source correctly have to join in the forwarding phase, we let the relays decoding successfully perform distributed beamforming to transmit information signals and the left relays decoding in error transmit jamming signals to improve the system secrecy capacity. For this purpose, we design a CVX toolbox based bi-level optimization algorithm to search the optimal beamforming vector and jamming vector for the relays via the semi-definite relaxation (SDR). Finally, the simulation results show that the proposed scheme outperforms existing secrecy schemes in DF relay networks.

DOI
10.1109/iccs.2016.7833619

Related papers

Joint distributed beamforming and jamming schemes in decode-and-forward relay networks for physical layer secrecy

Chengmin Gu, Chao Zhang

In this paper, we propose joint cooperative beamforming and jamming schemes in decode-and-forward (DF) relay networks for physical layer secrecy. In DF relay networks, only the relays decoding the message from the source correctly have to join in the forwarding phase and the relays with decoding error are not utilized sufficiently. Taking this property into consideration, we let the relays decoding successfully transmit information signals and the relays decoding in error transmit jamming signal to improve the secrecy capacity of system. For this purpose, we design a bi-level optimization algorithm to search the optimal beamforming vector and jamming vector for the relays via the semi-definite relaxation (SDR). In addition, for balancing the cost of system and secrecy performance, we also study some suboptimal schemes to improve information secrecy. Finally, the simulation results show that the optimal scheme outperforms all other simulated schemes and the suboptimal schemes achieve good tradeoff between secrecy performance and computational complexity.

EURASIP Journal on Wireless Communications and Networking•Dec 1, 2017•2 citations

Robust beamforming and cooperative jamming for secure transmission in DF relay systems

Bin Li, Zesong Fei

In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.

EURASIP Journal on Wireless Communications and Networking•Mar 1, 2016•11 citations

Distributed beamforming designs to improve physical layer security in wireless relay networks

Mujun Qian, Chen Liu, Youhua Fu

Abstract This paper investigates security-oriented beamforming designs in a relay network composed of a source-destination pair, multiple relays, and a passive eavesdropper. Unlike most of the earlier works, we assume that only statistical information of the relay-eavesdropper channels is known to the relays. We propose beamforming solutions for amplify-and-forward (AF) and decode-and-forward (DF) relay networks to improve secrecy capacity. In an AF network, the beamforming design is obtained by approximating a product of two correlated Rayleigh quotients to a single Rayleigh quotient using the Taylor series expansion. Our study reveals that in an AF network, the secrecy capacity does not always grow as the eavesdropper moves away from the relays or as total relay transmit power increases. Moreover, if the destination is nearer to the relays than the eavesdropper is, a suboptimal power is derived in closed form through monotonicity analysis of secrecy capacity. While in a DF network, secrecy capacity is a single Rayleigh quotient problem which can be easily solved. We also found that if the relay-eavesdropper distances are about the same, it is unnecessary to consider the eavesdropper in a DF network. Numerical results show that for either AF or DF relaying protocol, the proposed beamforming scheme provides higher secrecy capacity than traditional approaches.

EURASIP Journal on Advances in Signal Processing•Apr 28, 2014•7 citations

Joint Decode-and-Forward and jamming for wireless physical layer security with destination assistance

Yupeng Liu, Athina P. Petropulu, H. Vincent Poor

A distributed wireless network with one source, one destination, one eavesdropper and multiple Decode-and-Forward (DF) relays is considered. A two-slot cooperative relaying scheme is proposed, in which relays help the source transmit to the destination while keeping the message as secret as possible from the eavesdropper. In the first slot, the source transmits a weighted combination of the information bearing signal and a noise signal. At the same time, the destination cooperates with the source in transmitting a noise signal with the purpose of confounding the eavesdropper. In the second slot, the `best' relay cooperates with the source to send a jamming signal along the null space of the destination channel. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise is proposed. With the proposed transmission scheme, the system secrecy rate is shown to outperform the methods in literature and always benefits from increasing total power and larger number of relays.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•14 citations

Joint Cooperative Beamforming and Jamming for Physical-Layer Security of Decode-and-Forward Relay Networks

Haiyan Guo, Zhen Yang, Linghua Zhang +2 more

This paper proposes a new joint cooperative beamforming and jamming (JCBJ) scheme for improving the physical layer security of decode-and-forward wireless networks where a source node transmits to its destination with the aid of multiple intermediate nodes in the presence of an eavesdropper. In the proposed JCBJ scheme, we select the intermediate nodes succeeding in source decoding as the relays to forward the source transmission simultaneously by employing a beamforming weight vector, and meanwhile, use the remaining ones as the friendly jammers to disturb the eavesdropper by sending artificial noise. In order to achieve the secrecy rate maximum, we further study on the power allocation among the source, relays, and jammers under two assumptions of the wiretap link's channel state information. We derive the closed-form optimal solutions by first allocating the transmit power at the source within different ranges to consider all the possible relay selection schemes in which different numbers of relays are employed, and then transforming the multivariable power allocation problem to a set of single-variable optimization subproblems. Our numerical results show the superiority of the proposed JCBJ scheme and the proposed power allocation strategies.

IEEE Access•Jan 1, 2017•36 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
In this paper, we propose a joint distributed beamforming and jamming scheme in decode-and-forward (DF) relay networks to physical layer secrecy. Considering the special property of DF relay networks, where only the relays decoding the message from source correctly have to join in the forwarding phase, we let the relays decoding successfully perform distributed beamforming to transmit information signals and the left relays decoding in error transmit jamming signals to improve the system secrecy capacity. For this purpose, we design a CVX toolbox based bi-level optimization algorithm to search the optimal beamforming vector and jamming vector for the relays via the semi-definite relaxation (SDR). Finally, the simulation results show that the proposed scheme outperforms existing secrecy schemes in DF relay networks.
In this paper, we propose joint cooperative beamforming and jamming schemes in decode-and-forward (DF) relay networks for physical layer secrecy. In DF relay networks, only the relays decoding the message from the source correctly have to join in the forwarding phase and the relays with decoding error are not utilized sufficiently. Taking this property into consideration, we let the relays decoding successfully transmit information signals and the relays decoding in error transmit jamming signal to improve the secrecy capacity of system. For this purpose, we design a bi-level optimization algorithm to search the optimal beamforming vector and jamming vector for the relays via the semi-definite relaxation (SDR). In addition, for balancing the cost of system and secrecy performance, we also study some suboptimal schemes to improve information secrecy. Finally, the simulation results show that the optimal scheme outperforms all other simulated schemes and the suboptimal schemes achieve good tradeoff between secrecy performance and computational complexity.
In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.
Abstract This paper investigates security-oriented beamforming designs in a relay network composed of a source-destination pair, multiple relays, and a passive eavesdropper. Unlike most of the earlier works, we assume that only statistical information of the relay-eavesdropper channels is known to the relays. We propose beamforming solutions for amplify-and-forward (AF) and decode-and-forward (DF) relay networks to improve secrecy capacity. In an AF network, the beamforming design is obtained by approximating a product of two correlated Rayleigh quotients to a single Rayleigh quotient using the Taylor series expansion. Our study reveals that in an AF network, the secrecy capacity does not always grow as the eavesdropper moves away from the relays or as total relay transmit power increases. Moreover, if the destination is nearer to the relays than the eavesdropper is, a suboptimal power is derived in closed form through monotonicity analysis of secrecy capacity. While in a DF network, secrecy capacity is a single Rayleigh quotient problem which can be easily solved. We also found that if the relay-eavesdropper distances are about the same, it is unnecessary to consider the eavesdropper in a DF network. Numerical results show that for either AF or DF relaying protocol, the proposed beamforming scheme provides higher secrecy capacity than traditional approaches.
A distributed wireless network with one source, one destination, one eavesdropper and multiple Decode-and-Forward (DF) relays is considered. A two-slot cooperative relaying scheme is proposed, in which relays help the source transmit to the destination while keeping the message as secret as possible from the eavesdropper. In the first slot, the source transmits a weighted combination of the information bearing signal and a noise signal. At the same time, the destination cooperates with the source in transmitting a noise signal with the purpose of confounding the eavesdropper. In the second slot, the `best' relay cooperates with the source to send a jamming signal along the null space of the destination channel. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise is proposed. With the proposed transmission scheme, the system secrecy rate is shown to outperform the methods in literature and always benefits from increasing total power and larger number of relays.
This paper proposes a new joint cooperative beamforming and jamming (JCBJ) scheme for improving the physical layer security of decode-and-forward wireless networks where a source node transmits to its destination with the aid of multiple intermediate nodes in the presence of an eavesdropper. In the proposed JCBJ scheme, we select the intermediate nodes succeeding in source decoding as the relays to forward the source transmission simultaneously by employing a beamforming weight vector, and meanwhile, use the remaining ones as the friendly jammers to disturb the eavesdropper by sending artificial noise. In order to achieve the secrecy rate maximum, we further study on the power allocation among the source, relays, and jammers under two assumptions of the wiretap link's channel state information. We derive the closed-form optimal solutions by first allocating the transmit power at the source within different ranges to consider all the possible relay selection schemes in which different numbers of relays are employed, and then transforming the multivariable power allocation problem to a set of single-variable optimization subproblems. Our numerical results show the superiority of the proposed JCBJ scheme and the proposed power allocation strategies.
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.