Secure On-Off Transmission in Slow Fading Wiretap Channel With Imperfect CSI

This paper investigates the slow fading single-antenna wiretap channel with imperfect channel state information (CSI) and studies an on-off transmission scheme with fixed communication rate, secrecy rate, and transmit power for maximizing the secrecy throughput under the constraints of secrecy outag...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2017-10, Vol.66 (10), p.9582-9586
Main Authors: Mu, Pengcheng, Li, Zongze, Wang, Bo
Format: Article
Language:English
Subjects:
Cellular communication
Economic models
Fading
Fading channels
Imperfect channel state information
on-off transmission
Optimization
Physical layer
physical layer security
Probability density function
Receivers
Reliability
reliability outage probability
Searching
secrecy outage probability
Throughput
Transmitters
Upper bounds
Wiretapping
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 paper investigates the slow fading single-antenna wiretap channel with imperfect channel state information (CSI) and studies an on-off transmission scheme with fixed communication rate, secrecy rate, and transmit power for maximizing the secrecy throughput under the constraints of secrecy outage probability (SOP) and reliability outage probability (ROP). We first solve this problem in a special case without ROP constraint for which the optimal secrecy throughput is obtained under SOP constraint. The result for the special case gives us an upper bound for the secrecy throughput with imperfect CSI. With the help of this special case, a general case with ROP constraint is studied. In this case, the problem is transformed into a one-dimensional (1-D) search problem on a finite interval, which can be solved either by the exhaustive 1-D search to obtain the optimal solution or by the golden search method (GSM) to obtain a suboptimal solution. Simulation results are finally presented to validate the theoretical analysis and show that the performance obtained by using the GSM based 1-D search is very close to that of exhaustive 1-D search.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2017.2703861