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

National Conference on Communications

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

Sanjay Vishwakarma, A. Chockalingam

Published Feb 1, 2014• 8 citations
Publisher

Abstract

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.

DOI
10.1109/ncc.2014.6811256

Related papers

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

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

Amplify-and-forward relay beamforming for secrecy with cooperative jamming and imperfect CSI

Sanjay Vishwakarma, A. Chockalingam

In this paper, we compute worst case secrecy rates in amplify-and-forward (AF) relay beamforming with cooperative jamming (CJ) in the presence of imperfect channel state information (CSI). A source-destination pair aided by M relays is considered. Number of eavesdroppers J can be more than the number of relays. Out of the M relays, k1relays (1 ≤ k1≤ M) act as data relays and the remaining k2= M - k1relays act as jamming relays. Data relays aid the communication by relaying data in AF mode, and jamming relays cooperate by transmitting jamming signals (artificial noise). The jamming signals are created such that they degrade the eavesdroppers' channels but do not significantly affect the intended receiver's channel, thereby improving secrecy rate. Imperfection in the CSI is modeled using a norm-bounded error model. We solve for the optimum (k1, k2) and the weights of data relays and jamming relays that maximize the secrecy rate subject to a total relay power constraint. We relax the rank-one constraint on the complex semi-definite data relays and jamming relays weight matrices and reformulate the optimization problem into a form that can be solved using convex semi-definite programming. Numerical results on the secrecy rate that illustrate the effect of cooperative jamming, imperfect CSI, and number of eavesdroppers are presented.

International Conference on Communications•Jun 1, 2013•25 citations

The achievable secrecy rate of multi-antenna AF relaying using joint transmit and receive beamforming

Meysam Mirzaee, Soroush Akhlaghi

Physical layer security has attracted a great deal of attentions in recent years. This is achieved through using the physical layer characteristics to help sender to transfer data reliably with perfect secrecy. Using multiple-antenna relay node can improve the secrecy capacity of such channel. In this paper, we study the cooperative wiretap channel in which secure data transmission is achieved with the help of a MIMO Amplify and Forward (AF) relay. In such network, it is assumed multiple eavesdroppers attempt to listen to the relay transmitted signal and try to decode the source message. We assume the relay makes use of separated transmit/receive beamforming vectors, dubbed rank-one beamforming matrix. The beamforming vectors are computed such that the achievable secrecy rate is maximized, assuming the relay is subject to a maximum transmit power constraint. Accordingly, it is shown that the problem of finding proper receive beamforming vector can be translated into a scalar optimization problem, where using that the transmit beamforming vector can be obtained through solving a Semi-Definite Programming (SDP) problem.

International Symposium on Telecommunications•Sep 1, 2014•3 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

Secrecy rate optimization under cooperation with perfect channel state information

Jiangyuan Li, Athina P. Petropulu, Steven P. Weber

We investigate the problem of optimizing the secrecy rate of a link between a single source and a single destination in the presence of multiple relays and multiple eavesdroppers. Multiple relays assist the source by either retransmitting a weighted version of the source signal in a decode-and-forward (DF) fashion, or by performing cooperative jamming (CJ) i.e., transmitting weighted noise in order to confound the eavesdropper. In each protocol, the relay weights are designed to maximize the secrecy rate subject to a total power constraint. For the case of a single eavesdropper we obtain expressions for the optimal weights under both protocols in closed form, or propose the algorithms to research for the solution. For the DF protocol with multiple eavesdroppers we propose an algorithm to search for the solution. Numerical results illustrate that cooperation can significantly improve the system performance as compared to direct transmission.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Jan 1, 2009•17 citations
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.
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.
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 compute worst case secrecy rates in amplify-and-forward (AF) relay beamforming with cooperative jamming (CJ) in the presence of imperfect channel state information (CSI). A source-destination pair aided by M relays is considered. Number of eavesdroppers J can be more than the number of relays. Out of the M relays, k1relays (1 ≤ k1≤ M) act as data relays and the remaining k2= M - k1relays act as jamming relays. Data relays aid the communication by relaying data in AF mode, and jamming relays cooperate by transmitting jamming signals (artificial noise). The jamming signals are created such that they degrade the eavesdroppers' channels but do not significantly affect the intended receiver's channel, thereby improving secrecy rate. Imperfection in the CSI is modeled using a norm-bounded error model. We solve for the optimum (k1, k2) and the weights of data relays and jamming relays that maximize the secrecy rate subject to a total relay power constraint. We relax the rank-one constraint on the complex semi-definite data relays and jamming relays weight matrices and reformulate the optimization problem into a form that can be solved using convex semi-definite programming. Numerical results on the secrecy rate that illustrate the effect of cooperative jamming, imperfect CSI, and number of eavesdroppers are presented.
Physical layer security has attracted a great deal of attentions in recent years. This is achieved through using the physical layer characteristics to help sender to transfer data reliably with perfect secrecy. Using multiple-antenna relay node can improve the secrecy capacity of such channel. In this paper, we study the cooperative wiretap channel in which secure data transmission is achieved with the help of a MIMO Amplify and Forward (AF) relay. In such network, it is assumed multiple eavesdroppers attempt to listen to the relay transmitted signal and try to decode the source message. We assume the relay makes use of separated transmit/receive beamforming vectors, dubbed rank-one beamforming matrix. The beamforming vectors are computed such that the achievable secrecy rate is maximized, assuming the relay is subject to a maximum transmit power constraint. Accordingly, it is shown that the problem of finding proper receive beamforming vector can be translated into a scalar optimization problem, where using that the transmit beamforming vector can be obtained through solving a Semi-Definite Programming (SDP) problem.
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.
We investigate the problem of optimizing the secrecy rate of a link between a single source and a single destination in the presence of multiple relays and multiple eavesdroppers. Multiple relays assist the source by either retransmitting a weighted version of the source signal in a decode-and-forward (DF) fashion, or by performing cooperative jamming (CJ) i.e., transmitting weighted noise in order to confound the eavesdropper. In each protocol, the relay weights are designed to maximize the secrecy rate subject to a total power constraint. For the case of a single eavesdropper we obtain expressions for the optimal weights under both protocols in closed form, or propose the algorithms to research for the solution. For the DF protocol with multiple eavesdroppers we propose an algorithm to search for the solution. Numerical results illustrate that cooperation can significantly improve the system performance as compared to direct transmission.