Hybrid-ARQ Schemes for Reliable and Secret Wireless Communications
Hybrid automatic retransmission request (HARQ) schemes are revisited for a block fading wire-tap channel. Here, two legitimate users communicate over a block-fading channel in the presence of a passive eavesdropper who intercepts the transmissions through an independent block-fading channel. In this model, the transmitter obtains a 1-bit ACK/NACK feedback from the legitimate receiver via an error-free public channel. Both reliability and confidentiality of secure HARQ protocols are studied by joint consideration of channel coding, secrecy coding, and retransmission protocols. In particular, the error and secrecy performance of repetition time diversity (RTD) and incremental redundancy (INR) protocols are investigated based on Wyner code sequences. These protocols ensure that the confidential message is decoded successfully by the legitimate receiver and is kept completely secret from the eavesdropper for a set of channel realizations. It is illustrated that there exists a family of rate-compatible Wyner codes which ensure a secure INR protocol. Next, it also defines the connection outage and the secrecy outage probabilities that characterize the tradeoff between the reliability of the legitimate communication link and the confidentiality with respect to the eavesdropper's link, respectively. For a given connection/secrecy outage probability pair, an achievable throughput of secure HARQ protocols is derived for a block-fading channel. Finally, both asymptotic analysis and numerical calculations demonstrate the benefits of HARQ protocols to throughput and secrecy.
KeywordsChannel State Information Outage Probability Cyclic Redundancy Check Secrecy Capacity Channel Pair
Unable to display preview. Download preview PDF.
- 5.5. E. Soljanin, R. Liu, and P. Spasojevi´c, “Hybrid ARQ with random transmission assignments,” in Advances in Network Information Theory, ser. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, P. Gupta, G. Kramer, and A. J. van Wijngaarden, Eds. Providence, RI: American Mathematical Society, 2004, pp. 321–334.Google Scholar
- 8.E. Soljanin, N. Varnica, and P. Whiting, “Incremental redundancy hybrid ARQ with LDPC and raptor code,” IEEE Trans. Inf. Theory, submitted, Sept. 2005.Google Scholar
- 13.R. Liu, I. Maric, R. D. Yates, and P. Spasojevic, “The discrete memoryless multiple access channel with confidential messages,” in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, July 2006 pp. 957–961.Google Scholar
- 14.E. Tekin and A. Yener, “The Gaussian multiple access wire-tap channel with collective secrecy constraints,” in Proc. IEEE Int. Symp. Information Theory, Seattle,WA, July 2006 pp. 1164–1168.Google Scholar
- 16.J. Barros and M. R. D. Rodrigues, “Secrecy capacity of wireless channels,” in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, pp. 356–360, Jul. 2006,.Google Scholar
- 18.18. Z. Li, R. Yates, and W. Trappe, “Secrecy capacity of indepedent parallel channels,” in Proc. 44th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep. 2006.Google Scholar
- 19.P. Gopala, L. Lai, and H. El Gamal, “On the secrecy capacity of fading channels,” IEEE Trans. Inf. Theory, submitted, Oct. 2006. [Online]. Available: http://arxiv.org/abs/cs/0610103Google Scholar
- 20.20. X. Tang, R. Liu, P. Spasojevic, and H. V. Poor, “On the throughput of secure hybrid- ARQ protocols for Gaussian block-fading channels,” IEEE Trans. Inf. Theory, submitted, Dec. 2007. [Online]. Available: http://arxiv.org/abs/0712.4135Google Scholar
- 26.Physical Layer Standard for CDMA2000 Spread Spectrum Systems (Revision C), 3GPP2 Std. C.S0002-C, 2004.Google Scholar
- 28.28. T. Ghanim and M. Valenti, “The throughput of hybrid-ARQ in block fading under modulation constraints,” in Proc. IEEE Conference on Information Sciences and Systems, Princeton, NJ, Mar. 2006.Google Scholar
- 31.R. Liu, Y. Liang, H. V. Poor, and P. Spasojevic, “Secure nested codes for type II wiretap channels,” in Proc. IEEE Information Theory Workshop on Frontiers in Coding Theory, Lake Tahoe, CA, Sep. 2-6, 2007.Google Scholar
- 32.32. Y. Liang, H. V. Poor, S. Shamai, “Information Theoretic Security.” in Foundations and Trends in Communications and Information Theory. vol. 5, nos. 4-5, pp. 355–580, 2008.Google Scholar