TY - JOUR
T1 - When does relay transmission give a more secure connection in wireless ad hoc networks?
AU - Cai, Chunxiao
AU - Cai, Yueming
AU - Zhou, Xiangyun
AU - Yang, Weiwei
AU - Yang, Wendong
PY - 2014/4
Y1 - 2014/4
N2 - 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.
AB - 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.
KW - Secure connection probability
KW - colluding eavesdroppers
KW - homogenous Poisson point process
KW - non-colluding eavesdroppers
KW - randomize-and-forward
UR - http://www.scopus.com/inward/record.url?scp=84897855007&partnerID=8YFLogxK
U2 - 10.1109/TIFS.2013.2297835
DO - 10.1109/TIFS.2013.2297835
M3 - Article
SN - 1556-6013
VL - 9
SP - 624
EP - 632
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
IS - 4
M1 - 6702428
ER -