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/CIC International Conference on Communications in China (ICCC)

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

Chao Wang, Hui‐Ming Wang

Published Oct 1, 2014• 0 citations
Publisher

Abstract

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.

DOI
10.1109/iccchina.2014.7008310

Related papers

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

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

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

Joint cooperative beamforming and artificial noise design for secure AF relay networks with energy-harvesting eavesdroppers

Hehao Niu, Bangning Zhang, Daoxing Guo +2 more

In this paper, we investigate physical layer security for simultaneous wireless information and power transfer in amplify-and-forward relay networks. We propose a joint robust cooperative beamforming and artificial noise scheme for secure communication and efficient wireless energy transfer. Specifically, by treating the energy receiver as a potential eavesdropper and assuming that only imperfect channel state information can be obtained, we formulate an optimization problem to maximize the worst-case secrecy rate between the source and the legitimate information receiver under both the power constraint at the relays and the wireless power harvest constraint at the energy receiver. Since such a problem is non-convex and hard to tackle, we propose a two-level optimization approach which involves a one-dimensional search and semidefinite relaxation. Simulation results show that the proposed robust scheme achieves better worst-case secrecy rate performance than other schemes.

Frontiers of Information Technology & Electronic Engineering•Jun 1, 2017•3 citations

Robust Cooperative Beamforming and Artificial Noise Design for Physical-Layer Secrecy in AF Multi-Antenna Multi-Relay Networks

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

This paper is concerned with an optimization problem in a two-hop relay wiretap channel, wherein multiple multi-antenna relays collaboratively amplify and forward (AF) information from a single-antenna source to a single-antenna destination, and at the same time emit artificial noise (AN) to improve physical-layer information security in the presence of multiple multi-antenna eavesdroppers (or Eves). More specifically, the problem is to simultaneously optimize the AF matrices and AN covariances for secrecy rate maximization, with robustness against imperfect channel state information of Eves via a worst-case robust formulation. Such a problem is nonconvex, and we propose a polynomial-time optimization solution based on a two-level optimization approach and semidefinite relaxation (SDR). In particular, while SDR is generally an approximation technique, we prove that SDR is optimal in the specific context here. This desirable result is obtained by careful reformulation and Karush-Kuhn-Tucker optimality analysis, where, rather interestingly, AN is found to be instrumental in providing guarantee of SDR optimality. Simulation results are provided, and the results show that the proposed joint AF-AN solution can attain considerably higher achievable secrecy rates than some existing suboptimal designs.

IEEE Transactions on Signal Processing•Nov 10, 2014•140 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, 2014•13 citations
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.
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 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.
In this paper, we investigate physical layer security for simultaneous wireless information and power transfer in amplify-and-forward relay networks. We propose a joint robust cooperative beamforming and artificial noise scheme for secure communication and efficient wireless energy transfer. Specifically, by treating the energy receiver as a potential eavesdropper and assuming that only imperfect channel state information can be obtained, we formulate an optimization problem to maximize the worst-case secrecy rate between the source and the legitimate information receiver under both the power constraint at the relays and the wireless power harvest constraint at the energy receiver. Since such a problem is non-convex and hard to tackle, we propose a two-level optimization approach which involves a one-dimensional search and semidefinite relaxation. Simulation results show that the proposed robust scheme achieves better worst-case secrecy rate performance than other schemes.
This paper is concerned with an optimization problem in a two-hop relay wiretap channel, wherein multiple multi-antenna relays collaboratively amplify and forward (AF) information from a single-antenna source to a single-antenna destination, and at the same time emit artificial noise (AN) to improve physical-layer information security in the presence of multiple multi-antenna eavesdroppers (or Eves). More specifically, the problem is to simultaneously optimize the AF matrices and AN covariances for secrecy rate maximization, with robustness against imperfect channel state information of Eves via a worst-case robust formulation. Such a problem is nonconvex, and we propose a polynomial-time optimization solution based on a two-level optimization approach and semidefinite relaxation (SDR). In particular, while SDR is generally an approximation technique, we prove that SDR is optimal in the specific context here. This desirable result is obtained by careful reformulation and Karush-Kuhn-Tucker optimality analysis, where, rather interestingly, AN is found to be instrumental in providing guarantee of SDR optimality. Simulation results are provided, and the results show that the proposed joint AF-AN solution can attain considerably higher achievable secrecy rates than some existing suboptimal designs.
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.