Defending against wormhole attacks in mobile ad hoc networks
Article first published online: 9 JAN 2006
Copyright © 2006 John Wiley & Sons, Ltd.
Wireless Communications and Mobile Computing
Volume 6, Issue 4, pages 483–503, June 2006
How to Cite
Wang, W., Bhargava, B., Lu, Y. and Wu, X. (2006), Defending against wormhole attacks in mobile ad hoc networks. Wirel. Commun. Mob. Comput., 6: 483–503. doi: 10.1002/wcm.292
- Issue published online: 24 MAY 2006
- Article first published online: 9 JAN 2006
- NSF. Grant Numbers: ANI 0219110, IIS 0242840
- CISCO URP
- ad hoc network;
- wormhole attacks;
- end-to-end mechanism;
- overhead control
In ad hoc networks, malicious nodes can deploy wormhole attacks to fabricate a false scenario on the proximity relationship among mobile nodes. A classification of the attacks according to the format of the wormholes is proposed. This forms a basis to identify the detection capability of various approaches. An analysis shows that earlier approaches focus on the prevention of wormholes among neighbors that trust each other. As a more generic approach, we present an end-to-end scheme that can detect wormholes on a multi-hop route. Only the trust between the source and the destination is assumed. The mechanism uses geographic information to detect anomalies in neighbor relations and node movements. To reduce the computation and storage overhead, we present a scheme called cell-based open tunnel avoidance (COTA) to manage the information. COTA requires a constant space for every node on the path and the computation overhead increases linearly to the number of detection packets. We prove that the savings do not deteriorate the detection capability. Various schemes to control communication overhead are studied. The simulation and experiments on real devices show that the proposed mechanism can be combined with existent routing protocols to defend against wormhole attacks. Copyright © 2006 John Wiley & Sons, Ltd.