Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information
- 1 January 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 107-115
- https://doi.org/10.1109/infcom.2007.21
Abstract
We propose a novel algorithm for detecting worm-hole 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.Keywords
This publication has 14 references indexed in Scilit:
- MOBIWORP: Mitigation of the Wormhole Attack in Mobile Multihop Wireless NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- LITEWORP: A Lightweight Countermeasure for the Wormhole Attack in Multihop Wireless NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Visualization of wormholes in sensor networksPublished by Association for Computing Machinery (ACM) ,2004
- SECTORPublished by Association for Computing Machinery (ACM) ,2003
- Ad-hoc networks beyond unit disk graphsPublished by Association for Computing Machinery (ACM) ,2003
- A secure routing protocol for ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Secure link state routing for mobile ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Unit disk graph recognition is NP-hardComputational Geometry, 1998
- Sphere Packings, Lattices and GroupsGrundlehren der mathematischen Wissenschaften, 1993
- Some NP-complete geometric problemsPublished by Association for Computing Machinery (ACM) ,1976