Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies

  • Bassily, Raef (Department of Computer Science and Engineering, Pennsylvania State University) ;
  • Ulukus, Sennur (Department of Electrical and Computer Engineering, University of Maryland)
  • Received : 2012.01.30
  • Published : 2012.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we study the role of cooperative relays to provide and improve secure communication rates through decodeand-forward (DF) strategies in a full-duplex multiple relay network with an eavesdropper. We consider the DF scheme as a basis for cooperation and propose several strategies that implement different versions of this scheme suited for cooperation with multiple relays. Our goal is to give an efficient cooperation paradigm based on the DF scheme to provide and improve secrecy in a multiple relay network. We first study the DF strategy for secrecy in a single relay network. We propose a suboptimal DF with zero forcing (DF/ZF) strategy for which we obtain the optimal power control policy. Next, we consider the multiple relay problem. We propose three different strategies based on DF/ZF and obtain their achievable secrecy rates. The first strategy is a single hop strategy whereas the other two strategies are multiple hop strategies. In the first strategy, we show that it is possible to eliminate all the relays' signals from the eavesdropper's observation (full ZF), however, the achievable secrecy rate is limited by the worst source-relay channel. Our second strategy overcomes the drawback of the first strategy, however, with the disadvantage of enabling partial ZF only. Our third strategy provides a reasonable compromise between the first two strategies. That is, in this strategy, full ZF is possible and the rate achieved does not suffer from the drawback of the first strategy. We conclude our study by a set of numerical results to illustrate the performance of each of the proposed strategies in terms of the achievable rates in different practical scenarios.

Keywords

References

  1. Y. Oohama, "Capacity theorems for relay channels with confidential messages," in Proc. ISIT, Nice, France, June 2007, pp. 926-930.
  2. Y. Oohama and S.Watanabe. (2010, Sept.). Capacity results for relay channels with confidential messages. [Online]. Available: http://arxiv.org/pdf/1009.5829.pdf
  3. X. He and A. Yener, "Cooperation with an untrusted relay: A secrecy perspective," IEEE Trans. Inf. Theory, vol. 56, pp. 3801-3827, Aug. 2010.
  4. E. Ekrem and S. Ulukus, "Secrecy in cooperative relay broadcast channels," IEEE Trans. Inf. Theory, vol. 57, pp. 137-155, Jan. 2011.
  5. T. Cover and A. E. Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inf. Theory, vol. 25, pp. 572-584, Sept. 1979. https://doi.org/10.1109/TIT.1979.1056084
  6. L. Lai and H. E. Gamal, "Cooperation for secrecy: The relay-eavesdropper channel," IEEE Trans. Inf. Theory, vol. 54, pp. 4005-4019, Sept. 2008.
  7. X. He and A. Yener, "Cooperative jamming: The tale of friendly interference for secrecy," Securing Wireless Communications at the Physical Layer. W. Trappe and R. Liu, Eds., Springer-Verlag, 2009.
  8. R. Negi and S. Goel, "Secret communication using artificial noise," in Proc. IEEE VTC, Sept. 2005.
  9. E. Tekin and A. Yener, "The general Gaussian multiple-access and twoway wiretap channels: Achievable rates and cooperative jamming," IEEE Trans. Inf. Theory, vol. 54, pp. 2735-2751, June 2008.
  10. E. Tekin and A. Yener, "The Gaussian multiple access wiretap channel," IEEE Trans. Inf. Theory, vol. 54, pp. 5747-5755, Dec. 2008.
  11. X. He and A. Yener. (2009, July). Providing secrecy with structured codes: Tools and applications to two-user Gaussian channels. [Online]. Available: http://arxiv.org/pdf/0907.5388.pdf
  12. P. Xu, Z. Ding, X. Dai, and K. Leung. (2012, May). On the application of noisy network coding to the relay-eavesdropper channel. [Online]. Available: http://arxiv.org/abs/1203.5602
  13. S. H. Lim, Y.-H. Kim, A. E. Gamal, and S.-Y. Chung, "Noisy network coding," IEEE Trans. Inf. Theory, vol. 57, pp. 3132-3152, May 2011.
  14. I. Krikidis, J. Thompson, and S. McLaughlin, "Relay selection for secure cooperative networks with jamming," IEEE Trans.Wireless Commun., vol. 8, pp. 5003-5011, Oct. 2009.
  15. J. P. Vilela, M. Bloch, J. Barros, and S. W. McLaughlin, "Friendly jamming for wireless secrecy," in Proc. IEEE ICC, Cape Town, South Africa, May 2010, pp. 1-6.
  16. J. Huang and A. Swindlehurst, "Secure communications via cooperative jamming in two-hop relay systems," in Proc. IEEE GlobeCom, Miami, FL, Dec. 2010.
  17. R. Bassily and S. Ulukus, "Deaf cooperation for secrecy in mutiple-relay networks," in Proc. IEEE GLOBECOM, Houston, TX, Dec. 2011.
  18. L. Dong, Z. Han, A. P. Petropulu, and H. V. Poor, "Secure wireless communications via cooperation," in Proc. Allerton Conf. Commun., Control, Comput., Monticello, IL, Sept. 2008.
  19. J. Zhang and M. C. Gursoy, "Collaborative relay beamforming for secrecy," EURASIP J. Advances Signal Process., Aug. 2010. Submitted.
  20. S. Shafiee, N. Liu, and S. Ulukus, "Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: The 2-2-1 channel," IEEE Trans. Inf. Theory, vol. 55, pp. 4033-4039, Sept. 2009.
  21. A. Khisti and G. Wornell, "Secure transmission with multiple antenna: The MISOME wiretap channel," IEEE Trans. Inf. Theory, vol. 56, pp.3088-3104, July 2010.
  22. F. Oggier and B. Hassibi, "The secrecy capacity of the MIMO wiretap channel," IEEE Trans. Inf. Theory, vol. 57, pp. 4961-4972, Aug. 2011.
  23. T. Liu and S. Shamai, "A note on the secrecy capacity of the multipleantenna wiretap channel," IEEE Trans. Inf. Theory, vol. 55, pp. 2547- 2553, Jun. 2009.
  24. G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks," IEEE Trans. Inf. Theory, vol. 51, pp. 3037-3063, Sept. 2005. https://doi.org/10.1109/TIT.2005.853304
  25. P. Gupta and P. R. Kumar, "Towards an information theory of large networks: An achievable rate region," IEEE Trans. Inf. Theory, vol. 49, pp.1877-1894, Aug. 2003. https://doi.org/10.1109/TIT.2003.814480
  26. T. M. Cover and J. A. Thomas, Elements of Information theory. JohnWiley and Sons, 1991.