Outage Constrained Robust Secure Transmission for MISO Wiretap Channels

In this paper, we consider the robust secure beamformer design for multiple-input-single-output wiretap channels. Assuming that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power and the secrecy rate outage...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2014-10, Vol.13 (10), p.5558-5570
Main Authors: Ma, Shuai, Hong, Mingyi, Song, Enbin, Wang, Xiangfeng, Sun, Dechun
Format: Article
Language:English
Subjects:
Algorithms
Array signal processing
Channels
Constraints
Heuristic
Mathematical models
Maximization
Minimization
Outages
Receivers
Robustness
Uncertainty
Vectors
Wireless communication
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:In this paper, we consider the robust secure beamformer design for multiple-input-single-output wiretap channels. Assuming that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power and the secrecy rate outage probability constraint. The outage probability constraint requires that the secrecy rate exceed certain thresholds with high probability. Therefore, including such constraint in the design naturally ensures the desired robustness. Unfortunately, the presence of the probabilistic constraints makes the problem nonconvex and, hence, difficult to solve. In this paper, we investigate the outage probability constrained secrecy rate maximization problem using a novel two-step approach. Under a wide range of uncertainty models, our developed algorithms can obtain high-quality solutions, sometimes even exact global solutions, for the robust secure beamformer design problem. Simulation results are presented to verify the effectiveness and robustness of the proposed algorithms.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2014.2326415