A Packet Traversal Time per Hop based Adaptive Wormhole Detection Algorithm for MANETs

Karlsson, Jonny; Dooley, Laurence S. and Pulkkis, Goran (2016). A Packet Traversal Time per Hop based Adaptive Wormhole Detection Algorithm for MANETs. In: International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2016), 22-24 Sep 2016, Split, Croatia.

DOI: https://doi.org/10.1109/SOFTCOM.2016.7772109

URL: http://marjan.fesb.hr/SoftCOM/2016/

Abstract

Routing security challenges significantly impact the wide-scale adoption of mobile ad hoc networks (MANET), with wormholes constituting an especially severe threat. Wormhole detection algorithms like traversal time and hop count analysis (TTHCA) and modified transmission time-based mechanism (M-TTM) combine effective detection with low traffic overheads. TTHCA measures packet traversal time (PTT) per route hop count (HC), while M-TTM compares an expected round trip time (RTT) with a measured RTT. However, using only fixed thresholds for the permissible PTT/HC and measured RTT deviations respectively, both algorithms are compromised so participation mode (PM), out-of-band (O-B) wormholes are inadequately detected in MANETs with large radio range fluctuations. This paper presents an extended variant of the TTHCA algorithm called traversal time per hop analysis (TTpHA) that dynamically adapts the PTT per hop threshold to prevailing MANET conditions and nodes’ radio coverage. Experimental results confirm TTpHA provides superior PM O-B detection performance compared to TTHCA and M-TTM, with commensurately low false positive rates and traffic overheads.