When Does Relay Transmission Give a More Secure Connection in Wireless Ad Hoc Networks?

Relay transmission can enhance coverage and throughput, whereas it can be vulnerable to eavesdropping attacks due to the additional transmission of the source message at the relay. Thus, whether or not one should use relay transmission for secure communication is an interesting and important problem. In this paper, we consider the transmission of a confidential message from a source to a destination in a decentralized wireless network in the presence of randomly distributed eavesdroppers. The source-destination pair can be potentially assisted by randomly distributed relays. For an arbitrary relay, we derive exact expressions of secure connection probability for both colluding and noncolluding eavesdroppers. We further obtain lower bound expressions on the secure connection probability, which are accurate when the eavesdropper density is small. Using these lower bound expressions, we propose a relay selection strategy to improve the secure connection probability. By analytically comparing the secure connection probability for direct transmission and relay transmission, we address the important problem of whether or not to relay and discuss the condition for relay transmission in terms of the relay density and source-destination distance. These analytical results are accurate in the small eavesdropper density regime.

[1]  Meixia Tao,et al.  Relay Placement for Physical Layer Security: A Secure Connection Perspective , 2012, IEEE Communications Letters.

[2]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[3]  T. Mattfeldt Stochastic Geometry and Its Applications , 1996 .

[4]  Ulrike Goldschmidt,et al.  An Introduction To The Theory Of Point Processes , 2016 .

[5]  Zhu Han,et al.  Improving Wireless Physical Layer Security via Cooperating Relays , 2010, IEEE Transactions on Signal Processing.

[6]  Hesham El Gamal,et al.  The Relay–Eavesdropper Channel: Cooperation for Secrecy , 2006, IEEE Transactions on Information Theory.

[7]  Matthieu R. Bloch,et al.  Wireless Information-Theoretic Security , 2008, IEEE Transactions on Information Theory.

[8]  Il-Min Kim,et al.  Optimal power allocation for secure multi-carrier relay systems , 2011, 2011 8th International Workshop on Multi-Carrier Systems & Solutions.

[9]  A. Robert Calderbank,et al.  Modeling location uncertainty for eavesdroppers: A secrecy graph approach , 2010, 2010 IEEE International Symposium on Information Theory.

[10]  Can Emre Koksal,et al.  On Secrecy Capacity Scaling in Wireless Networks , 2012, IEEE Trans. Inf. Theory.

[11]  Onur Ozan Koyluoglu,et al.  On Secrecy Capacity Scaling in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[12]  Robert Tibshirani,et al.  An Introduction to the Bootstrap , 1994 .

[13]  Il-Min Kim,et al.  Optimal Power Allocation for Secure Multicarrier Relay Systems , 2011, IEEE Transactions on Signal Processing.

[14]  Moe Z. Win,et al.  Secure Communication in Stochastic Wireless Networks—Part I: Connectivity , 2012, IEEE Transactions on Information Forensics and Security.

[15]  Martin Haenggi The secrecy graph and some of its properties , 2008, 2008 IEEE International Symposium on Information Theory.

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

[17]  Kerstin Vogler,et al.  Table Of Integrals Series And Products , 2016 .

[18]  Zhu Han,et al.  Joint Relay and Jammer Selection for Secure Two-Way Relay Networks , 2011, IEEE Transactions on Information Forensics and Security.

[19]  Yueming Cai,et al.  Secure Connectivity Using Randomize-and-Forward Strategy in Cooperative Wireless Networks , 2013, IEEE Communications Letters.

[20]  John S. Thompson,et al.  Relay selection for secure cooperative networks with jamming , 2009, IEEE Transactions on Wireless Communications.

[21]  Jeffrey G. Andrews,et al.  Stochastic geometry and random graphs for the analysis and design of wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

[22]  Moe Z. Win,et al.  Continuum percolation in the intrinsically secure communications graph , 2010, 2010 International Symposium On Information Theory & Its Applications.

[23]  Martin Haenggi,et al.  On distances in uniformly random networks , 2005, IEEE Transactions on Information Theory.

[24]  Jeffrey G. Andrews,et al.  Secure Wireless Network Connectivity with Multi-Antenna Transmission , 2011, IEEE Transactions on Wireless Communications.