Secure Routing in Full-Duplex Jamming Multihop Relaying

Abstract

In this paper, we consider the secure connection problem in multihop wireless networks with full-duplex (FD) jamming relaying, where the colluding eavesdroppers are randomly distributed following a homogeneous Poisson point process (PPP). By applying FD, each legitimate node (including relay and destination) jams the eavesdroppers when it receives the desired signal from transmitter. We adopt the end- to- end secure connection probability (SCP) as a secrecy metric to characterize the physical layer security performance. We first derive the exact expression of SCP for any given path. Then, an approximation of the SCP is proposed to facilitate efficient secure routing by using a revised Bellman- Ford algorithm. We show that a notable performance gain can be achieved by the proposed scheme compared to the half-duplex (HD) scheme, if the self- interference can be well canceled. Simulation results verify our theoretical analysis.