Defending against wormhole attacks in mobile ad hoc networks: Research Articles

Authors:
Weichao Wang;Bharat Bhargava;Yi Lu;Xiaoxin Wu
Affiliations:
Department of Computer Sciences, Purdue University, W. Lafayette, IN, USA;Department of Computer Sciences, Purdue University, W. Lafayette, IN, USA;Department of Computer Sciences, Purdue University, W. Lafayette, IN, USA;Department of Computer Sciences, Purdue University, W. Lafayette, IN, USA
Venue:
Wireless Communications & Mobile Computing
Year:
2006

Citing 0
Cited 8

A novel clustering algorithm based on GPS of the mobile ad hoc network

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Wormhole attack detection based on distance verification and the use of hypothesis testing for wireless ad hoc networks

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Wormholes no more? localized wormhole detection and prevention in wireless networks

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
CTAC: Control traffic tunneling attacks' countermeasures in mobile wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Topological detection on wormholes in wireless ad hoc and sensor networks

IEEE/ACM Transactions on Networking (TON)
Immunizing mobile ad hoc networks against collaborative attacks using cooperative immune model

Security and Communication Networks
Review: Securing DSR against wormhole attacks in multirate ad hoc networks

Journal of Network and Computer Applications
LDAC: A localized and decentralized algorithm for efficiently countering wormholes in mobile wireless networks

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.