Secure Routing In Full-Duplex Jamming Multihop Relaying
2016 IEEE Global Communications Conference (GLOBECOM)(2016)
摘要
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.
更多查看译文
关键词
routing security,full-duplex jamming multihop relaying,homogeneous Poisson point process,end-to-end secure connection probability,physical layer security,revised Bellman-Ford algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络