ARQ secrecy over correlated fading channels

In this paper, we develop novel Automatic Repeat reQuest (ARQ) key sharing protocols for correlated fading channels. In particular, a novel role of “dumb antennas” in overcoming the negative impact of spatial correlation, on the achievable secrecy rates, is unveiled. We further develop an adaptive rate allocation policy which achieves higher secrecy rates by exploiting the channel temporal correlation. The performance gains offered by the proposed schemes are demonstrated by a comprehensive set of numerical results.

[1]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

[2]  Ruoheng Liu,et al.  On the Achievable Secrecy Throughput of Block Fading Channels with No Channel State Information at Transmitter , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[3]  H. Vincent Poor,et al.  On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[4]  Hesham El Gamal,et al.  ARQ-Based Secret Key Sharing , 2009, 2009 IEEE International Conference on Communications.

[5]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[6]  Athanasios Papoulis,et al.  Probability, random variables, and stochastic processes , 2002 .

[7]  Hesham El Gamal,et al.  On the Secrecy Capacity of Fading Channels , 2006, 2007 IEEE International Symposium on Information Theory.

[8]  Ahmed Sultan,et al.  Keys through ARQ , 2009, ArXiv.