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

IET Communications

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

Zhi Lin, Yueming Cai, Weiwei Yang, Lei Wang

Published May 27, 2016• 7 citations
Publisher

Abstract

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.

DOI
10.1049/iet-com.2016.0051

Related papers

Robust secure switching transmission in MISOSE relaying networks with channel uncertainty

Zhi Lin, Lei Wang, Yueming Cai +2 more

In this paper, we investigate the physical layer security of multiple-input single-output single-antenna eavesdropper relaying networks with imperfect channel state information. Different from traditional strategies in relay systems, which would halt the communication if the relay could not decode the signal successfully, we propose a robust secure transmission strategy which switches between cooperative jamming and decoded-and-forward. Our objective is to maximize secrecy rate, given the unavailability of the perfect eavesdropper channel state information, we propose a worst-case robust design based on secrecy rate. In addition, a traditional robust scheme and a non-robust scheme are put forward as benchmarks. Simulation results verify that the proposed scheme based on robust designs can achieve significant security performance gains over other approaches. More interestingly, because of the influence of cooperative jamming, the security performance of non-robust scheme outperforms the traditional robust designs in low transmit power and low channel error coefficient regions.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2015•1 citation

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 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 Access•Jan 1, 2016•7 citations

Robust joint beamforming and artificial noise design for secure AF relay networks

Chao Wang, Hui‐Ming Wang

This letter studies the secure cooperative transmission for an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. Since the perfect channel state information (CSI) of the eavesdroppers are not available, we propose a robust joint distributed beamforming and artificial noise scheme to maximize the worst-case secrecy rate of the network, under the total power constraint of all the relay nodes. With the semidefinite relaxation (SDR) technique, the design can be solved by a one-dimension search which involves a sequence of semidefinite programming (SDP). Simulation results demonstrate the validity of the proposed strategy.

IEEE/CIC International Conference on Communications in China (ICCC)•Oct 1, 2014•0 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 Processing•Apr 1, 2015•4 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 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.
In this paper, we investigate the physical layer security of multiple-input single-output single-antenna eavesdropper relaying networks with imperfect channel state information. Different from traditional strategies in relay systems, which would halt the communication if the relay could not decode the signal successfully, we propose a robust secure transmission strategy which switches between cooperative jamming and decoded-and-forward. Our objective is to maximize secrecy rate, given the unavailability of the perfect eavesdropper channel state information, we propose a worst-case robust design based on secrecy rate. In addition, a traditional robust scheme and a non-robust scheme are put forward as benchmarks. Simulation results verify that the proposed scheme based on robust designs can achieve significant security performance gains over other approaches. More interestingly, because of the influence of cooperative jamming, the security performance of non-robust scheme outperforms the traditional robust designs in low transmit power and low channel error coefficient regions.
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.
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.
This letter studies the secure cooperative transmission for an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. Since the perfect channel state information (CSI) of the eavesdroppers are not available, we propose a robust joint distributed beamforming and artificial noise scheme to maximize the worst-case secrecy rate of the network, under the total power constraint of all the relay nodes. With the semidefinite relaxation (SDR) technique, the design can be solved by a one-dimension search which involves a sequence of semidefinite programming (SDP). Simulation results demonstrate the validity of the proposed strategy.
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.
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.