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

Worst case SINR guarantees for secrecy using relay beamforming with imperfect CSI

Agepati Sujana, Sanjay Vishwakarma, A. Chockalingam

Published Apr 1, 2014• 4 citations
Publisher

Abstract

In this paper, we study beamforming techniques for secrecy with worst case signal-to-interference-plus-noise ratio (SINR) guarantees in cooperative communications with imperfect channel state information (CSI). The worst case SINRs are the minimum SINR at the intended destination and the maximum SINR at the eavesdroppers. We consider a norm bounded CSI error model. With the available imperfect channel estimates, we design beamformers such that the minimum SINR receivable by the intended destination is above a certain threshold, while the maximum value of SINRs receivable at the eavesdroppers are below another lower threshold. We consider amplify-and-forward (AF) and decode-and-forward (DF) relaying schemes. The relays do the worst case transmit beamforming and injection of artificial noise (AN). We jointly optimize the beamformers and the AN for the AF and DF schemes subject to the worst case SINR constraints at the destination and the eavesdroppers. We solve the corresponding optimization problems as semi-definite programming (SDP) problems by rank relaxation and S-procedure. Numerical results show that AN injection at the relays significantly reduces the average total transmit power required to meet the worst case SINR constraints, and improves the solution feasibility of the optimization problems.

DOI
10.1109/wcnc.2014.6952282

Related papers

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•24 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

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

Robust Cooperative Relay Beamforming Design for Security

Xiangwu Gong, Feihong Dong, Hongjun Li +1 more

In this paper, we investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper.While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message.The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination.Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques.The benefit of the proposed scheme is showed in simulation results.

KSII Transactions on Internet and Information Systems•Nov 30, 2015•0 citations

Robust Beamforming Techniques for MISO Secrecy Communication with a Cooperative Jammer

Zheng Chu, Martin Johnston, Stephane Le Goff

This paper investigates robust beamforming techniques for a multiple-input-single-output (MISO) secrecy transmission with a cooperative jammer by incorporating two different types of channel uncertainties. We solve the worst-case signal-to-interference-plus-noise ratio (SINR) maximization of the legitimate user with the worst-case SINR constraint of the eavesdropper and the transmit power constraint. The original problems are not convex in terms of transmit covariance matrices, and cannot be solved directly. Thus, we present two approaches to convert these problems into semidefinite programmings (SDPs) by exploiting S-Procedure and deriving the corresponding Lagrangian dual problem. Numerical results are provided to validate the performance of the proposed robust schemes.

IEEE Vehicular Technology Conference•May 1, 2015•7 citations

Collaborative Relay Beamforming for Secrecy

Junwei Zhang, M. Cenk Gursoy

In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, decode-and-forward (DF) and amplify-and-forward (AF) relay beamforming designs under total and individual relay power constraints are studied with the goal of maximizing the secrecy rates when perfect channel state information (CSI) is available. In the DF scheme, the total power constraint leads to a closed-form solution, and in this case, the optimal beamforming structure is identified in the low and high signal-to-noise ratio (SNR) regimes. The beamforming design under individual relay power constraints is formulated as an optimization problem which is shown to be easily solved using two different approaches, namely semidefinite programming and second-order cone programming. A simplified and suboptimal technique which reduces the computation complexity under individual power constraints is also presented. In the AF scheme, not having analytical solutions for the optimal beamforming design under both total and individual power constraints, an iterative algorithm is proposed to numerically obtain the optimal beamforming structure and maximize the secrecy rates. Finally, robust beamforming designs in the presence of imperfect CSI are investigated for DF-based relay beamforming, and optimization frameworks are provided

arXiv:1006.4386•Jun 22, 2010•6 citations
In this paper, we study beamforming techniques for secrecy with worst case signal-to-interference-plus-noise ratio (SINR) guarantees in cooperative communications with imperfect channel state information (CSI). The worst case SINRs are the minimum SINR at the intended destination and the maximum SINR at the eavesdroppers. We consider a norm bounded CSI error model. With the available imperfect channel estimates, we design beamformers such that the minimum SINR receivable by the intended destination is above a certain threshold, while the maximum value of SINRs receivable at the eavesdroppers are below another lower threshold. We consider amplify-and-forward (AF) and decode-and-forward (DF) relaying schemes. The relays do the worst case transmit beamforming and injection of artificial noise (AN). We jointly optimize the beamformers and the AN for the AF and DF schemes subject to the worst case SINR constraints at the destination and the eavesdroppers. We solve the corresponding optimization problems as semi-definite programming (SDP) problems by rank relaxation and S-procedure. Numerical results show that AN injection at the relays significantly reduces the average total transmit power required to meet the worst case SINR constraints, and improves the solution feasibility of the optimization problems.
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.
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 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 investigate a security transmission scheme at the physical layer for cooperative wireless relay networks in the presence of a passive eavesdropper.While the security scheme has been previously investigated with perfect channel state information(CSI) in the presence of a passive eavesdropper, this paper focuses on researching the robust cooperative relay beamforming mechanism for wireless relay networks which makes use of artificial noise (AN) to confuse the eavesdropper and increase its uncertainty about the source message.The transmit power used for AN is maximized to degrade the signal-to-interference-plus-noise-ratio (SINR) level at the eavesdropper, while satisfying the individual power constraint of each relay node and worst-case SINR constraint at the desired receiver under a bounded spherical region for the norm of the CSI error vector from the relays to the destination.Cooperative beamforming weight vector in the security scheme can be obtained by using S-Procedure and rank relaxation techniques.The benefit of the proposed scheme is showed in simulation results.
This paper investigates robust beamforming techniques for a multiple-input-single-output (MISO) secrecy transmission with a cooperative jammer by incorporating two different types of channel uncertainties. We solve the worst-case signal-to-interference-plus-noise ratio (SINR) maximization of the legitimate user with the worst-case SINR constraint of the eavesdropper and the transmit power constraint. The original problems are not convex in terms of transmit covariance matrices, and cannot be solved directly. Thus, we present two approaches to convert these problems into semidefinite programmings (SDPs) by exploiting S-Procedure and deriving the corresponding Lagrangian dual problem. Numerical results are provided to validate the performance of the proposed robust schemes.
In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, decode-and-forward (DF) and amplify-and-forward (AF) relay beamforming designs under total and individual relay power constraints are studied with the goal of maximizing the secrecy rates when perfect channel state information (CSI) is available. In the DF scheme, the total power constraint leads to a closed-form solution, and in this case, the optimal beamforming structure is identified in the low and high signal-to-noise ratio (SNR) regimes. The beamforming design under individual relay power constraints is formulated as an optimization problem which is shown to be easily solved using two different approaches, namely semidefinite programming and second-order cone programming. A simplified and suboptimal technique which reduces the computation complexity under individual power constraints is also presented. In the AF scheme, not having analytical solutions for the optimal beamforming design under both total and individual power constraints, an iterative algorithm is proposed to numerically obtain the optimal beamforming structure and maximize the secrecy rates. Finally, robust beamforming designs in the presence of imperfect CSI are investigated for DF-based relay beamforming, and optimization frameworks are provided