Cooperative Secure Beamforming for AF Relay Networks With Multiple Eavesdroppers

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2013-01, Vol.20 (1), p.35-38
Main Authors: Ye Yang, Qiang Li, Wing-Kin Ma, Jianhua Ge, Ching, P. C.
Format: Article
Language:English
Subjects:
Amplify-and-forward relaying
Array signal processing
cooperative beamforming
Noise
Optimization
physical-layer security
Relays
Search problems
Security
semidefinite relaxation
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2012.2227313