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 Vehicular Technology Conference

Optimal Transmit Design at Relay Nodes for Secure AF Relay Networks

Lingxiang Li, Liu Li, Zhi Chen, Jun Fang

Published May 1, 2015• 1 citation
Publisher

Abstract

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.

DOI
10.1109/vtcspring.2015.7145986

Related papers

Robust transmit design for secure AF relay networks based on worst-case optimization

Lingxiang Li, Zhi Chen, Jun Fang

This paper studies robust transmit design to maximize the worst-case secrecy rate in AF networks under both total and individual relay power constraints. Channel state information (CSI) in the network is assumed to be perfectly known except for that associated with the eavesdroppers whose imperfection is modeled as deterministic bounded errors. To use the power at the relay nodes more efficiently, a joint cooperative relaying and jamming scheme is considered. Through some matrix manipulations, we recast the original nonconvex optimization problem as a sequence of semidefinite programs (SDPs), which enables us to obtain the optimal relay weights and the optimal covariance matrix of the jamming signal. Numerical results are presented to show the efficacy of the proposed scheme.

IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2014•9 citations

Robust transmit design for secure AF relay networks with imperfect CSI

Lingxiang Li, Yu Xu, Zhi Chen +1 more

This paper studies robust transmit design for secure AF relay networks with imperfect channel state information (CSI). Two CSI error models, deterministically bounded error model and stochastic error model, are considered. In order to use the power at relays more efficiently, a joint cooperative relaying and jamming scheme is considered, where relays cooperate to forward the source signal and simultaneously they cooperate to send jamming signals to confuse the eavesdroppers. In this joint cooperative relaying and jamming framework, we address the robust joint optimization of the relay weights and the input covariance matrix of jamming signals for secrecy rate maximization (SRM), under both total and individual relay power constraints. Specifically, for the case of deterministically bounded error model, where the CSI error can be specified by an uncertainty set, we maximize the worst-case secrecy rate. While for the case of stochastic error model, where the probability distribution of the CSI error is Gaussian, we maximize the outage constrained secrecy rate. The challenge of these considered SRM-based optimizations lies in their non-convexity. This paper shows that such SRM-based optimization can be solved in a convex fashion and via solving a sequence of semidefinite programs (SDPs). Numerical results are presented to show the efficacy of the proposed scheme.

EURASIP Journal on Wireless Communications and Networking•Jun 2, 2016•4 citations

Cooperative Secure Beamforming for AF Relay Networks With Multiple Eavesdroppers

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

This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.

IEEE Signal Processing Letters•Nov 20, 2012•178 citations

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

Yan Yan, Bangning Zhang, Daoxing Guo +3 more

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.

Wireless and Optical Communications Conference•May 1, 2016•17 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

An Effective Secure Transmission Scheme for AF Relay Networks with Two-Hop Information Leakage

Meilu Lin, Jianhua Ge, Yang Ye

In this letter, we propose a novel scheme to improve physical layer security for amplify-and-forward (AF) relay networks with two-hop information leakage. Unlike traditional joint cooperative beamforming (CB) and cooperative jamming (CJ) design, where mere artificial noise (AN) is exploited by the jammers to degrade eavesdroppers' channels, in our proposed scheme, the jammers send AN along with the confidential signal to simultaneously confuse the eavesdroppers and enhance the quality of received signals at the destination. In particular, the CB vectors and AN covariance matrix are jointly optimized for the relays and jammers under individual power constraints. By decoupling this resultant design problem, suboptimal solutions are obtained using the semidefinite relaxation technique. Simulation results are also provided to demonstrate that the proposed scheme has an obvious advantage in enhancing the secrecy rate.

IEEE Communications Letters•Jul 2, 2013•22 citations
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 robust transmit design to maximize the worst-case secrecy rate in AF networks under both total and individual relay power constraints. Channel state information (CSI) in the network is assumed to be perfectly known except for that associated with the eavesdroppers whose imperfection is modeled as deterministic bounded errors. To use the power at the relay nodes more efficiently, a joint cooperative relaying and jamming scheme is considered. Through some matrix manipulations, we recast the original nonconvex optimization problem as a sequence of semidefinite programs (SDPs), which enables us to obtain the optimal relay weights and the optimal covariance matrix of the jamming signal. Numerical results are presented to show the efficacy of the proposed scheme.
This paper studies robust transmit design for secure AF relay networks with imperfect channel state information (CSI). Two CSI error models, deterministically bounded error model and stochastic error model, are considered. In order to use the power at relays more efficiently, a joint cooperative relaying and jamming scheme is considered, where relays cooperate to forward the source signal and simultaneously they cooperate to send jamming signals to confuse the eavesdroppers. In this joint cooperative relaying and jamming framework, we address the robust joint optimization of the relay weights and the input covariance matrix of jamming signals for secrecy rate maximization (SRM), under both total and individual relay power constraints. Specifically, for the case of deterministically bounded error model, where the CSI error can be specified by an uncertainty set, we maximize the worst-case secrecy rate. While for the case of stochastic error model, where the probability distribution of the CSI error is Gaussian, we maximize the outage constrained secrecy rate. The challenge of these considered SRM-based optimizations lies in their non-convexity. This paper shows that such SRM-based optimization can be solved in a convex fashion and via solving a sequence of semidefinite programs (SDPs). Numerical results are presented to show the efficacy of the proposed scheme.
This letter studies cooperative secure beamforming for amplify-and-forward (AF) relay networks in the presence of multiple eavesdroppers. Under both total and individual relay power constraints, we propose two schemes, namely secrecy rate maximization (SRM) beamforming and null-space beamforming. In the first scheme, our design problem is based on SRM. Using a suboptimal, but convex, technique-semidefinite relaxation (SDR), we show that this problem can be handled by performing a one-dimensional search which involves solving a sequence of semidefinite programs (SDPs). To reduce the complexity, in the second scheme, we instead maximize the information rate at the destination while completely eliminating the information leakage to all eavesdroppers. We prove that this problem can be exactly solved by SDR with one SDP only. Simulation results demonstrate the performance gains of the two proposed designs.
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.
In this letter, we propose a novel scheme to improve physical layer security for amplify-and-forward (AF) relay networks with two-hop information leakage. Unlike traditional joint cooperative beamforming (CB) and cooperative jamming (CJ) design, where mere artificial noise (AN) is exploited by the jammers to degrade eavesdroppers' channels, in our proposed scheme, the jammers send AN along with the confidential signal to simultaneously confuse the eavesdroppers and enhance the quality of received signals at the destination. In particular, the CB vectors and AN covariance matrix are jointly optimized for the relays and jammers under individual power constraints. By decoupling this resultant design problem, suboptimal solutions are obtained using the semidefinite relaxation technique. Simulation results are also provided to demonstrate that the proposed scheme has an obvious advantage in enhancing the secrecy rate.