skip to main content
10.1145/3345768.3355928acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

Secrecy in Dual-Hop Relaying Network Using the Independent Randomize-and-Forward Strategy

Published: 25 November 2019 Publication History

Abstract

In this paper, we investigate secure communication for a dual-hop relay channel in the presence of an eavesdropper. A novel independent randomize-and-forward (IRF) strategy is proposed to enhance the secrecy performance, where the relay maps the decoded message to an independent message set then encodes the message by random-coding argument. For the discrete model, we establish the achievable rate-equivocation for the IRF strategy. For the Gaussian model, we derive the perfect secrecy rate of IRF strategy and compare it with decode-and-forward (DF), amplify-and-forward (AF) and noise-forwarding (NF) strategies. Theoretical analysis indicates that the relay's engagement of independent secure coding enhances the security of transmission. Numerical results also show the proposed IRF strategy can significantly improve the secrecy performance of the dual-hop relay channel in some cases.

References

[1]
I. Csiszar and J. Korner. 1978. Broadcast channels with confidential messages. IEEE Trans.Inf. Theory, Vol. IT-24, 3 (May 1978), 339--348.
[2]
Bin Duo, Wang Peng, Yonghui Li, and Branka Vucetic. 2014. Secure transmission for relay-eavesdropper channels using polar coding. IEEE International Conference on Communications (2014), 2197--2202.
[3]
Georges Kaddoum Furqan Jameel, Shurjeel Wyne and Trung Q. Duong. 2018. A Comprehensive Survey on Cooperative Relaying and Jamming Strategies for Physical Layer Security. IEEE Communications Surveys and Tutorials (2018).
[4]
O. Ozan Koyluoglu, C. Emre Koksal, and Hesham El Gamal. 2010. On Secrecy Capacity Scaling in Wireless Networks. IEEE Transactions on Information Theory, Vol. 58, 5 (2010), 3000--3015.
[5]
Lifeng Lai and Hesham El Gamal. 2008. The Relay-Eavesdropper Channel: Cooperation for Secrecy. IEEE Trans.Inf. Theory, Vol. 54, 9 (September 2008), 4005--4019.
[6]
Ninoslav Marina, Hideki Yagi, and H. Vincent Poor. 2011. Improved Rate-Equivocation Regions for Secure Cooperative Communication. IEEE Int. Symposium on Information Theory (2011).
[7]
Jianhua Mo, Meixia Tao, and Yuan Liu. 2012. Relay Placement for Physical Layer Security: A Secure Connection Perspective. IEEE Communications Letters, Vol. 16, 6 (2012), 878--881.
[8]
Xu Peng, Zhiguo Ding, Xuchu Dai, and Kin K. Leung. 2013. An improved achievable secrecy rate for the relay-eavesdropper channel. In Wireless Communications and Networking Conference. 2440--2445.
[9]
C. E. Shannon. 1949. Communication theory of secrecy systems. Bell Syst.tech.j, Vol. 28, 4 (October 1949), 656--715.
[10]
Amir Sonee and Somayeh Salimi. 2010. A new achievable rate-equivocation region for the relay-eavesdropper channel. In Electrical Engineering .
[11]
Xiaojun Tang, Ruoheng Liu, P Spasojevic, and H. V Poor. 2009. Interference-assisted secret communication. IEEE Information Theory Workshop (2009).
[12]
Ender Tekin and Aylin Yener. 2008. The Gaussian Multiple Access Wire-Tap Channel. IEEE Transactions on Information Theory, Vol. 54, 12 (2008), 5747--5755.
[13]
Wyner and D A. 1975. The wire-tap channel. Bell Syst.tech.j, Vol. 54, 8 (1975), 1355--1387.

Index Terms

  1. Secrecy in Dual-Hop Relaying Network Using the Independent Randomize-and-Forward Strategy

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      MSWIM '19: Proceedings of the 22nd International ACM Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
      November 2019
      340 pages
      ISBN:9781450369046
      DOI:10.1145/3345768
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 25 November 2019

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. eavesdropper
      2. independent randomize-and-forward(irf)
      3. rate-equivocation region
      4. relaying network
      5. secrecy rate

      Qualifiers

      • Research-article

      Conference

      MSWiM '19
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 398 of 1,577 submissions, 25%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 42
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 05 Mar 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media