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

Wireless and Optical Communications Conference

Joint beamforming and jamming design for secure cooperative hybrid satellite-terrestrial relay network

Yan Yan, Bangning Zhang, Daoxing Guo, Shengnan Li, Hehao Niu, Xi Wang

Published May 1, 2016• 17 citations
Publisher

Abstract

This paper investigates the secure transmit design of a cooperative hybrid satellite-terrestrial relay network (HSTRN). Assuming that amplify-and-forward (AF) protocol is adapted at terrestrial relays, and global channel state information (CSI) is known, we propose two schemes through jointly optimizing the relay beamforming vector and the covariance matrix of artificial noise (AN) to maximize the secrecy rate. In the first scheme, our design is based on secrecy rate maximization and optimal solution is obtained by following the idea of two-level optimization which is composed of one-dimensional search technique and semidefinite relaxation (SDR) technique. In the second scheme, to reduce the computation, we assume that there is no information leakage to all eavesdroppers, and the solution of this problem is obtained by solving one semidefinite programing (SDP) only with SDR. Numerical results are provided to demonstrate the performance of different designs and the benefit of AN.

DOI
10.1109/wocc.2016.7506598

Related papers

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

Optimal Transmit Design at Relay Nodes for Secure AF Relay Networks

Lingxiang Li, Liu Li, Zhi Chen +1 more

We study the transmit design at relay nodes for secure amplify-and-forward (AF) networks. Two joint cooperative relaying and jamming schemes, namely Secrecy Rate Maximization Scheme and Null-Space Jamming Scheme, are proposed. In the first scheme, optimal relaying weight vector and optimal covariance matrix associated with the artificial noise (AN) are obtained, which involves doing a one-dimensional search and solving a sequence of semidefinite programs(SDPs). In the second scheme, which is suboptimal but computationally much cheaper, AN is designed to decrease the rate at the eavesdropper while the relaying weight vector is determined to increase the rate at the destination. In addition, Power Allocation based on secrecy rate maximization provides a balance between these two goals. Numerical results show that the proposed Secrecy Rate Maximization Scheme outperforms the existing cooperative relaying without jamming scheme. Especially, when the power is large enough, the secrecy rate achieved by the proposed schemes approaches the maximal achievable rate for the no-eavesdropper case.

IEEE Vehicular Technology Conference•May 1, 2015•1 citation

Optimal joint cooperative beamforming and artificial noise design for secrecy rate maximization in AF relay networks

Ye Yang, Qiang Li, Wing‐Kin Ma +2 more

This paper studies cooperative secure transmission in wireless relay networks, where a source sends a confidential message to a legitimate destination through a set of amplify-and-forward (AF) relays in the presence of multiple eavesdroppers. To prevent the eavesdroppers from retrieving the message, we assume that the relays employ a joint cooperative beamforming (CB) and artificial noise (AN) strategy. Under both the total and individual relay power constraints, we propose an optimal joint CB-AN design based on secrecy rate maximization (SRM). We treat the SRM problem by a combination of two-level optimization and semidefinite relaxation (SDR). For the latter, we prove that SDR always has a rank-one solution for the SRM problem - which identifies that SDR is optimal. Simulation results are presented to show the efficacy of the proposed joint CB-AN design.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2013•27 citations

Robust Joint Beamforming and Jamming for Secure AF Networks: Low-Complexity Design

Chao Wang, Hui‐Ming Wang

This paper investigates the physical-layer security issue of an amplify-and-forward (AF) relay network. We propose a joint cooperative beamforming (CB) and cooperative jamming (CJ) design that is robust to the imperfect channel state information (CSI) of the multiple multiantenna eavesdroppers. The objective is the worst-case secrecy rate maximization (WCSRM). Based on the inner convex approximation and semidefinite relaxation (SDR) technique, the original nonconvex problem is transformed into a sequence of approximate convex problems, which can be solved conveniently. The proposed robust design guarantees to converge to a Karush-Kuhn-Tucker (KKT) solution and is efficient in computational complexity. Furthermore, we prove that SDR always has a rank-1 solution, which identifies that SDR is tight. Simulations demonstrate the validity of the proposed strategy.

IEEE Transactions on Vehicular Technology•Jul 2, 2014•70 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

Low Complexity Cooperative Transmission Design and Optimization for Physical Layer Security of AF Relay Networks

Chao Wang, Hui‐Ming Wang, Weile Zhang

This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.

IEICE Transactions on Communications•Jan 1, 2014•0 citations
This paper investigates the secure transmit design of a cooperative hybrid satellite-terrestrial relay network (HSTRN). Assuming that amplify-and-forward (AF) protocol is adapted at terrestrial relays, and global channel state information (CSI) is known, we propose two schemes through jointly optimizing the relay beamforming vector and the covariance matrix of artificial noise (AN) to maximize the secrecy rate. In the first scheme, our design is based on secrecy rate maximization and optimal solution is obtained by following the idea of two-level optimization which is composed of one-dimensional search technique and semidefinite relaxation (SDR) technique. In the second scheme, to reduce the computation, we assume that there is no information leakage to all eavesdroppers, and the solution of this problem is obtained by solving one semidefinite programing (SDP) only with SDR. Numerical results are provided to demonstrate the performance of different designs and the benefit of AN.
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.
We study the transmit design at relay nodes for secure amplify-and-forward (AF) networks. Two joint cooperative relaying and jamming schemes, namely Secrecy Rate Maximization Scheme and Null-Space Jamming Scheme, are proposed. In the first scheme, optimal relaying weight vector and optimal covariance matrix associated with the artificial noise (AN) are obtained, which involves doing a one-dimensional search and solving a sequence of semidefinite programs(SDPs). In the second scheme, which is suboptimal but computationally much cheaper, AN is designed to decrease the rate at the eavesdropper while the relaying weight vector is determined to increase the rate at the destination. In addition, Power Allocation based on secrecy rate maximization provides a balance between these two goals. Numerical results show that the proposed Secrecy Rate Maximization Scheme outperforms the existing cooperative relaying without jamming scheme. Especially, when the power is large enough, the secrecy rate achieved by the proposed schemes approaches the maximal achievable rate for the no-eavesdropper case.
This paper studies cooperative secure transmission in wireless relay networks, where a source sends a confidential message to a legitimate destination through a set of amplify-and-forward (AF) relays in the presence of multiple eavesdroppers. To prevent the eavesdroppers from retrieving the message, we assume that the relays employ a joint cooperative beamforming (CB) and artificial noise (AN) strategy. Under both the total and individual relay power constraints, we propose an optimal joint CB-AN design based on secrecy rate maximization (SRM). We treat the SRM problem by a combination of two-level optimization and semidefinite relaxation (SDR). For the latter, we prove that SDR always has a rank-one solution for the SRM problem - which identifies that SDR is optimal. Simulation results are presented to show the efficacy of the proposed joint CB-AN design.
This paper investigates the physical-layer security issue of an amplify-and-forward (AF) relay network. We propose a joint cooperative beamforming (CB) and cooperative jamming (CJ) design that is robust to the imperfect channel state information (CSI) of the multiple multiantenna eavesdroppers. The objective is the worst-case secrecy rate maximization (WCSRM). Based on the inner convex approximation and semidefinite relaxation (SDR) technique, the original nonconvex problem is transformed into a sequence of approximate convex problems, which can be solved conveniently. The proposed robust design guarantees to converge to a Karush-Kuhn-Tucker (KKT) solution and is efficient in computational complexity. Furthermore, we prove that SDR always has a rank-1 solution, which identifies that SDR is tight. Simulations demonstrate the validity of the proposed strategy.
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.
This paper studies the design of cooperative beamforming (CB) and cooperative jamming (CJ) for the physical layer security of an amplify-and-forward (AF) relay network in the presence of multiple multi-antenna eavesdroppers. The secrecy rate maximization (SRM) problem of such a network is to maximize the difference of two concave functions, a problem which is non-convex and has no efficient solution. Based on the inner convex approximation (ICA) and semidefinite relaxation (SDR) techniques, we propose two novel low-complexity schemes to design CB and CJ for SRM in the AF network. In the first strategy, relay nodes adopt the CB only to secure transmission. Based on ICA, this design guarantees convergence to a Karush-Kuhn-Tucker (KKT) solution of the SDR of the original problem. In the second strategy, the optimal joint CB and CJ design is studied and the proposed joint design can guarantee convergence to a KKT solution of the original problem. Moreover, in the second strategy, we prove that SDR always has a rank-1 solution for the SRM problem. Simulation results show the superiority of the proposed schemes.