Secure Routing in Multihop Wireless Ad-hoc Networks with Decode-and-Forward Relaying
Jianping Yao, Suili Feng, Xiangyun Zhou, Yuan Liu

TL;DR
This paper addresses secure routing in multihop wireless ad-hoc networks with decode-and-forward relays, modeling eavesdroppers as a Poisson process, and proposes an efficient algorithm to maximize end-to-end security performance.
Contribution
It introduces an analytical framework for physical layer security in multihop networks with random eavesdroppers and develops a distributed routing algorithm to optimize security.
Findings
The proposed scheme nearly matches exhaustive search performance.
Accurate SCP approximations enable efficient secure routing.
The method effectively enhances physical layer security in ad-hoc networks.
Abstract
In this paper, we study the problem of secure routing in a multihop wireless ad-hoc network in the presence of randomly distributed eavesdroppers. Specifically, the locations of the eavesdroppers are modeled as a homogeneous Poisson point process (PPP) and the source-destination pair is assisted by intermediate relays using the decode-and-forward (DF) strategy. We analytically characterize the physical layer security performance of any chosen multihop path using the end-to-end secure connection probability (SCP) for both colluding and non-colluding eavesdroppers. To facilitate finding an efficient solution to secure routing, we derive accurate approximations of the SCP. Based on the SCP approximations, we study the secure routing problem which is defined as finding the multihop path having the highest SCP. A revised Bellman-Ford algorithm is adopted to find the optimal path in a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
