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

被引:42
作者
Cai, Chunxiao [1 ]
Cai, Yueming [1 ]
Zhou, Xiangyun [2 ]
Yang, Weiwei [1 ]
Yang, Wendong [1 ]
机构
[1] Peoples Liberat Army Univ Sci & Technol, Coll Commun Engn, Nanjing 210007, Jiangsu, Peoples R China
[2] Australian Natl Univ, Res Sch Engn, Acton 0200, Australia
关键词
Secure connection probability; homogenous Poisson point process; randomize-and-forward; colluding eavesdroppers; non-colluding eavesdroppers;
D O I
10.1109/TIFS.2013.2297835
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:624 / 632
页数:9
相关论文
共 20 条
  • [1] [Anonymous], 1996, Stochastic Geometry and its Applications
  • [2] Wireless information-theoretic security
    Bloch, Matthieu
    Barros, Joao
    Rodrigues, Miguel R. D.
    McLaughlin, Steven W.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2515 - 2534
  • [3] Secure Connectivity Using Randomize-and-Forward Strategy in Cooperative Wireless Networks
    Cai, Chunxiao
    Cai, Yueming
    Yang, Weiwei
    Yang, Wendong
    [J]. IEEE COMMUNICATIONS LETTERS, 2013, 17 (07) : 1340 - 1343
  • [4] Joint Relay and Jammer Selection for Secure Two-Way Relay Networks
    Chen, Jingchao
    Zhang, Rongqing
    Song, Lingyang
    Han, Zhu
    Jiao, Bingli
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2012, 7 (01) : 310 - 320
  • [5] Daley Daryl J., 2008, INTRO THEORY POINT P, VII
  • [6] Improving Wireless Physical Layer Security via Cooperating Relays
    Dong, Lun
    Han, Zhu
    Petropulu, Athina P.
    Poor, H. Vincent
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (03) : 1875 - 1888
  • [7] Modeling Location Uncertainty for Eavesdroppers: A Secrecy Graph Approach
    Goel, Satashu
    Aggarwal, Vaneet
    Yener, Aylin
    Calderbank, A. Robert
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 2627 - 2631
  • [8] On distances in uniformly random networks
    Haenggi, M
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) : 3584 - 3586
  • [9] The Secrecy Graph and Some of its Properties
    Haenggi, Martin
    [J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 539 - 543
  • [10] Haenggi M, 2009, IEEE J SEL AREA COMM, V27, P1029, DOI 10.1109/JSAC.2009.090902