Computer Science – Information Theory
Scientific paper
2009-01-19
Computer Science
Information Theory
Proceedings of the 2009 IEEE International Symposium on Information Theory (ISIT 2009), Seoul, Korea, June 28-July 3, 2009
Scientific paper
In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.
Gamal Hesham El
Khalil Karim
Koyluoglu Onur Ozan
Youssef Moustafa
No associations
LandOfFree
On the Delay Limited Secrecy Capacity of Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Delay Limited Secrecy Capacity of Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Delay Limited Secrecy Capacity of Fading Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-565995