Joint Power and Secret Key Queue Management for Delay Limited Secure Communication

In recent years, the famous wiretap channel has been revisited by many researchers and information theoretic secrecy has become an active area of research in this setting. In this paper, we design a wireless communication system that achieves constant bit rate data transmission over a block fading channel, securely from an eavesdropper that listens to the transmitter over another independent block fading channel. It is well known that, the method of sending secure information using the binning techniques inspired by the wiretap channel fails to secure the information at times when the eavesdropper channel has favorable conditions over the main channel. This phenomenon is called secrecy outage. In our system, however, we exploit the times at which the main channel is favorable over the eavesdropper channel for us to be able to transmit some random secret key bits along with the data bits. These key bits are stored in a separate key queue at the transmitter as well as the receiver, and are utilized to secure data bits, whenever the channel conditions favor the eavesdropper. We show that, our system achieves a high performance at any given desired outage probability by jointly controlling the key queue and the transmit power. We show that the optimal power control involves a time sharing between secure waterfilling and channel inversion strategies and the key queue operates in the heavy traffic regime to achieve the maximum delay limited rate possible, under a small outage constraint. This work can be viewed as a first step in providing a framework that combines both information theory and queueing analysis for the study of information theoretic security.

[1]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[2]  J. Kingman On Queues in Heavy Traffic , 1962 .

[3]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[4]  S. Hanly,et al.  Multi-access fading channels: delay-limited capacities , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[6]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  David Tse,et al.  Multiaccess Fading Channels-Part II: Delay-Limited Capacities , 1998, IEEE Trans. Inf. Theory.

[8]  Moustafa Youssef,et al.  On the delay limited secrecy capacity of fading channels , 2009, 2009 IEEE International Symposium on Information Theory.

[9]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[10]  Roy D. Yates,et al.  Service outage based power and rate allocation , 2003, IEEE Trans. Inf. Theory.

[11]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[12]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .