A Review : Wormhole Attack and Wireless Sensor Networks

Abstract

Wormhole attacks are a type of security threat where an attacker captures packets at one location in a network and tunnels them to another location to retransmit them, bypassing intermediate nodes. These attacks are difficult to detect and can cause serious damage to the network. The proposed technique involves constructing a graph representation of the network topology and analyzing the shortest path between nodes. The technique uses two algorithms: the Floyd-Warshall algorithm and the Dijkstra algorithm, to compute the shortest paths and identify any anomalies in the graph. The technique is shown to be effective in detecting wormhole attacks with high accuracy and low false positives. The paper provides a comprehensive review of existing techniques for wormhole attack detection and compares them with the proposed technique. It also discusses the limitations and future directions of research in this area. Overall, the proposed graph-based technique is a promising approach for detecting wormhole attacks in WSNs, and has the potential to improve the security of these networks.