PTT: Packet Travel Time Algorithm in Mobile Ad Hoc Networks

The wormhole attack is hard to detect and can be easily implemented. An attacker may receive packets from one location in the network and tunnel them to the other end point in a different location and re-inject them into the network. Attackers can tunnel the packets by one of the following methods: encapsulating the packets, using out-of-bound links or using high power. If there are two or more malicious nodes in the network involved in a wormhole attack, the attack becomes more powerful. There are two types of wormhole attacks: hidden mode, and exposed (participation) mode. In this paper, we present an algorithm for detecting wormhole attacks, whether in hidden or exposed mode in wireless multi-hop net-works without special hardware. Our algorithm is an improvement on another algorithm which is based on transmission time-based mechanism (TTM). Moreover, our algorithm introduces a new mechanism called Packet Travel Time (PTT). This mechanism allows each device to monitor its neighbours’ behaviour. Therefore, this mechanism can detect both hidden and exposed wormhole attacks, and can locate the wormhole in AODV, and DSR protocol.

[1]  Liu Fagui,et al.  Research & implementation of uCLinux-based embedded browser , 2007 .

[2]  Mu Haibing,et al.  Security evaluation model for threshold cryptography applications in MANET , 2010, 2010 2nd International Conference on Computer Engineering and Technology.

[3]  Jun-Zhao Sun.  Mobile ad hoc networking: an essential technology for pervasive computing , 2001, 2001 International Conferences on Info-Tech and Info-Net. Proceedings (Cat. No.01EX479).

[4]  King-Shan Lui,et al.  DelPHI: wormhole detection mechanism for ad hoc wireless networks , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

[5]  Jean-Philippe Babau,et al.  Detecting wormhole attacks in wireless networks using local neighborhood information , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.

[6]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[7]  Jean-Pierre Hubaux,et al.  The quest for security in mobile ad hoc networks , 2001, MobiHoc '01.

[8]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[9]  Mario Joa-Ng,et al.  A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[10]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[11]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[12]  G. Vinitha,et al.  An Approach Towards Detection of Wormhole Attack in Sensor Networks , 2010, 2010 First International Conference on Integrated Intelligent Computing.

[13]  Heejo Lee,et al.  Transmission Time-Based Mechanism to Detect Wormhole Attacks , 2007, The 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007).

[14]  Radha Poovendran,et al.  SeRLoc: Robust localization for wireless sensor networks , 2005, TOSN.

[15]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[16]  Majid Khabbazian,et al.  NIS02-1: Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure , 2006, IEEE Globecom 2006.