DIMH: A novel model to detect and isolate malicious hosts for mobile ad hoc network

Abstract Since route discovery based on broadcasting query packets is the basis of route protocol in ad hoc network, any node may compromise the routing protocol functionality by disrupting the route discovery process by modifying routing topology information, by fabricating false routing topology information and by impersonating other nodes. To solve the problem of security routing and ensure the right routing information, we present a novel model called DIMH to detect, isolate the malicious host and provide the integrity and authentication mechanism for routing information. Method of isolating malicious host and ensuring the right route information is that the i  + 1 th malicious host is carried out by cooperation between the i th host and i  + 2 th host. The model can validly detect attack from two colluding malicious hosts that cooperate to tamper with routing information. Our model guarantees that fabricated, compromised, or replayed route replies would either be rejected or never reach back the querying node.

[1]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[2]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[3]  Panagiotis Papadimitratos,et al.  Secure message transmission in mobile ad hoc networks , 2003, Ad Hoc Networks.

[4]  Ran Canetti,et al.  Efficient and Secure Source Authentication for Multicast , 2001, NDSS.

[5]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2002, MobiCom '02.

[6]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[7]  Frank Stajano,et al.  The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks , 1999, Security Protocols Workshop.

[8]  Philippe Jacquet,et al.  Overhead in Mobile Ad-hoc Network Protocols , 2000 .

[9]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[10]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[11]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

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

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

[14]  Panagiotis Papadimitratos,et al.  Secure Routing for Mobile Ad Hoc Networks , 2002 .

[15]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[16]  Y. Jay Guo,et al.  Synchronisation Techniques for HIPERLAN , 1997, Wirel. Pers. Commun..

[17]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).