Avoiding virtual link attacks in wireless ad hoc networks

A mobile ad hoc network is made of a collection of nodes connected through a wireless medium and form a wireless multihop network with possible changing topologies. The widely accepted existing routing protocols designed to accommodate the needs of such self-organized networks do not address possible threats or attacks aiming at the disruption of the protocol itself. The widely assumed trusted environment is not really the environment that can be realistically expected in reality. In this paper, we describe a new attack against routing protocols which we call virtual link attack, where a misbehaving node tries to relay any Hello message originated from its neighbors aiming to create fake symmetric links in the network. We show that this attack can severely compromise any routing protocol and may lead to large data packets loss. We specifically analyze this attack under the optimized link state routing (OLSR) protocol in detail and devise a symmetric neighbor verification protocol (SNVP) to alleviate its impact and severity.

[1]  Philippe Jacquet,et al.  Investigating the impact of partial topology in proactive MANET routing protocols , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

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

[3]  Nei Kato,et al.  A study of a routing attack in OLSR-based mobile ad hoc networks , 2007, Int. J. Commun. Syst..

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

[6]  Liang Hong,et al.  Secure OLSR , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[7]  Nei Kato,et al.  A Collusion Attack Against OLSR-based Mobile Ad Hoc Networks , 2006 .

[8]  Yih-Chun Hu Packet Leashes : A Defense against Wormhole Attacks in Wireless Ad Hoc Networks , 2001 .

[9]  Nei Kato,et al.  NIS01-2: A Collusion Attack Against OLSR-based Mobile Ad Hoc Networks , 2006, IEEE Globecom 2006.

[10]  Thomas Clausen,et al.  The Optimized Link State Routing Protocol: Evaluation through Experiments and Simulation , 2001 .

[11]  Yih-Chun Hu,et al.  Packet leashes: a defense against wormhole attacks in wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[12]  William Stallings,et al.  Data and Computer Communications , 1985 .

[13]  Turgay Korkmaz Verifying physical presence of neighbors against replay-based attacks in wireless ad hoc networks , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[14]  Jang-Ping Sheu,et al.  A clock synchronization algorithm for multi-hop wireless ad hoc networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[15]  Marco Conti,et al.  IEEE 802.11 optimal performances: RTS/CTS mechanism vs. basic access , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[16]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[17]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.