EURASIP Journal on Wireless Communications and Networking

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

Bin Li, Zesong Fei

Published Mar 1, 2016• 11 citations

Abstract

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.

DOI: 10.1186/s13638-016-0560-1

Related papers

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 CommunicationsFeb 1, 20148 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 CommunicationsJun 1, 201325 citations

Robust joint beamforming and artificial noise design for amplify-and-forward multi-antenna relay systems

Lijian Zhang, Liang Jin, Wenyu Luo +2 more

In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.

IEEE International Conference on Acoustics Speech and Signal ProcessingApr 1, 20154 citations

Robust Beamforming and Jamming for Secure AF Relay Networks with Multiple Eavesdroppers

Cong Zhang, Hui Gao, Haijing Liu +1 more

In this paper, we study the secrecy transmission in multi-antenna relay networks with multiple eavesdroppers. The relay employs the amplify-and-forward relaying protocol and simultaneously sends the artificial noise to interfere the eavesdroppers. It is assumed that only imperfect channel state information on the main and eavesdropping channels is available at the relay. We exploit the robust beam forming and jamming to maximize the worst-case secrecy rate under a total relay power budget. Because of the infinitely nonconvex constraints, the problem is difficult to solve. Therefore, we approximate the problem into several tractable semi definite programs by semi definite relaxation, S-procedure, and the successive convex approximation techniques. Simulation results show the effectiveness of the proposed scheme.

IEEE Military Communications Conference (MILCOM)Oct 1, 201413 citations

Robust Beamforming and Power Allocation for Secrecy in DF Relay Networks With Imperfect Channel State Information

Weichen Wang, Tiejun Lv, Hui Gao

We address a robust beamforming design and power allocation problem for a one-way multi-antenna relay network, where the multi-antenna source implements communication with the multi-antenna destination via a decode-and-forward (DF) relay in the presence of the multiple single-antenna eavesdroppers. The eavesdroppers can only overhear the information flowed from the relay to the destination in the second hop. We aim to maximize the worst-case secrecy rate in the condition that the global channel state information (CSI) is imperfect. To this end, we propose the joint beamforming and power allocation design for the worst-case secrecy rate maximization. However, our proposed design constitutes a non-convex problem, which involves an infinite number of constraints because of the imperfect CSI. To make the problem more tractable, we approximate the problem into several tractablesemidefinite programs by semidefinite relaxation, successive convex approximation, and S-procedure techniques, and we propose an iterative algorithm to solve the problem. Furthermore, we show that the proposed algorithm is also applicable for the case the Gaussian wiretap model, where only the eavesdroppers' CSI is imperfect. Simulation results validate the effectiveness of the proposed algorithm.

IEEE AccessJan 1, 20167 citations

Robust secure switching transmission in multi‐antenna relaying systems: cooperative jamming or decode‐and‐forward beamforming

Zhi Lin, Yueming Cai, Weiwei Yang +1 more

In this study, the authors investigate the physical layer security for safeguarding secure transmission in multi‐antenna relaying networks with imperfect channel state information (CSI). Different from traditional strategies in multi‐antenna relaying systems, which would terminate the communication if the relay could not decode the signals successfully, the authors propose robust secure transmission strategy which switches between cooperative jamming (CJ) and decode‐and‐forward (DF) beamforming. Specifically, if the received signal‐to‐noise ratio at the relay is lower than a predefined threshold, it will impose CJ signals on potential eavesdropper, otherwise the relay would operate DF beamforming. The authors’ objective is to maximise secrecy rate and minimise secrecy outage probability in different practical communication scenarios with relaxed or strict time‐delay constraint. Thus, given the unavailability of the perfect eavesdropping CSI, the authors propose a worst‐case robust design and a statistical‐approach robust design based on secrecy rate and secrecy outage criterion, respectively. In addition, a traditional DF robust scheme and a non‐robust scheme are also considered as benchmarks. Simulation results verify that the proposed scheme significantly outperforms the traditional DF robust scheme and the non‐robust scheme.

IET CommunicationsMay 27, 20167 citations