Sciweavers

INFOCOM
2007
IEEE

Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information

14 years 4 months ago
Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substructures in the connectivity graph. The proposed approach is completely localized and, unlike many techniques proposed in literature, does not use any special hardware artifact or location information, making the technique universally applicable. The algorithm is independent of wireless communication models. However, knowledge of the model and node distribution helps estimate a parameter used in the algorithm. We present simulation results for three different communication models and two different node distributions, and show that the algorithm is able to detect wormhole attacks with a 100% detection and 0% false alarm probabilities whenever the network is connected with high probability. Even for very low density networks where chances of disconnection is very high, the detection probability remains very high...
Ritesh Maheshwari, Jie Gao, Samir R. Das
Added 03 Jun 2010
Updated 03 Jun 2010
Type Conference
Year 2007
Where INFOCOM
Authors Ritesh Maheshwari, Jie Gao, Samir R. Das
Comments (0)