Abstract
This paper studies finding the secure path according to the secrecy connectivity probability (SCP) in the multihop ad hoc networks in the presence of inhomogeneous eavesdropper clusters. We consider both random and fixed eavesdropper clusters, where the former case assumes that there is no knowledge of the locations of the clusters and the latter case assumes that the locations of the clusters can be estimated accurately. First, we derive the end-to-end SCP to characterize the secrecy performance of a given path in a general multihop wireless network with half-duplex randomize-and-forward relaying. Then, we consider a full-duplex scheme at the legitimate receiver, which receives the useful information while broadcasting a jamming signal to the potential eavesdroppers to further enhance the secrecy connectivity. Then, a novel secure routing algorithm that can provide the maximum SCP for any legitimate transmitter/receiver pair in a distributed manner is proposed. The theoretical analysis is verified by Monte Carlo simulation results. The results show that our secure routing algorithm provides similar results compared to an exhaustive search. For the random eavesdropper cluster case, the optimal route is independent of the knowledge of the cluster, which is the same as the homogeneous eavesdropper case. However, for the case where eavesdropper clusters are fixed and their locations are known a priori , the optimal path selection depends on the radii and locations of the eavesdropper clusters and the average number of eavesdroppers in each cluster.
Highlights
This motivates us to consider extending the rich set of results available for Poisson point process (PPP) to other node distributions, i.e., Poisson cluster process (PCP), in the context of secure routing based on physical layer security (PLS)
We assume that the channel state information (CSI) between the source and relays are known by each other and the signal transmission is achieved by using the time division multiple access (TDMA)3
In the last Section, we provided the exact expressions of the secrecy connectivity probability (SCP) with the cases of half and full-duplex receiver under fixed eavesdropper clusters for a given path
Summary
The concept of wireless ad hoc networks refers to the network model where devices directly transmit information signals to each other by utilizing point-to-point channels without using centralized infrastructure. In order to consider the uncertainty of eavesdropper locations, in 2008, a powerful scheme to model the randomly located eavesdroppers in large scale networks was provided by [6], [7], in which the nodes may spread out across the area, which is an analytically convenient and reasonable assumption for homogeneously located nodes in wireless networks. The clustering of eavesdropper nodes may be due to geographical factors, i.e., communicating users in a building or groups of nodes moving in a coordinated fashion, which can be modeled by geographical clustering This motivates us to consider extending the rich set of results available for PPPs to other node distributions, i.e., Poisson cluster process (PCP), in the context of secure routing based on PLS
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
