A secure ad-hoc routing approach using localized self-healing communities

Mobile ad hoc networks (MANETs) are vulnerable to routing attacks, especially attacks launched by non-cooperative (selfish or compromised) network members and appear to be protocol compliant. For instance, since packet loss is common in mobile wireless networks, the adversary can exploit this fact by hiding its malicious intents using compliant packet losses that appear to be caused by environmental reasons.In this paper we study two routing attacks that use non-cooperative network members and disguised packet losses to deplete ad hoc network resources and to reduce ad hoc routing performance. These two routing attacks have not been fully addressed in previous research. We propose the design of "self-healing community" to counter these two attacks. Our design exploits the redundancy in deployment which is typical of most ad hoc networks; Namely, it counters non-cooperative attacks using the probabilistic presence of nearby cooperative network members.To realize the new paradigm, we devise localized simple schemes to (re-)configure self-healing communities in spite of random node mobility. We develop a general analytic model to prove the effectiveness of our design. Then we implement our secure ad hoc routing protocols in simulation to verify the cost and overhead incurred by maintaining the communities. Our study confirms that the community-based security is a cost-effective strategy to make off-the-shelf ad hoc routing protocols secure.

[1]  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.

[2]  Elizabeth M. Belding-Royer,et al.  A secure routing protocol for ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[3]  Baruch Awerbuch,et al.  An on-demand secure routing protocol resilient to byzantine failures , 2002, WiSE '02.

[4]  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).

[5]  Mingyan Liu,et al.  Sound mobility models , 2003, MobiCom '03.

[6]  Paolo Santi,et al.  An analysis of the node spatial distribution of the random waypoint mobility model for ad hoc networks , 2002, POMC '02.

[7]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[8]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.

[9]  David Chaum,et al.  Distance-Bounding Protocols (Extended Abstract) , 1994, EUROCRYPT.

[10]  Panagiotis Papadimitratos,et al.  Secure data transmission in mobile ad hoc networks , 2003, WiSe '03.

[11]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[12]  Victor C. M. Leung,et al.  Secure Routing for Mobile Ad Hoc Networks , 2006 .

[13]  Elizabeth M. Belding-Royer,et al.  Dynamically Adaptive Multipath Routing based on AODV , 2004 .

[14]  Xiaoyan Hong,et al.  L ’ Hospital : Self-healing Secure Routing for Mobile Ad-hoc Networks , 2005 .

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

[16]  Christian Wagner,et al.  The Spatial Node Distribution of the Random Waypoint Mobility Model , 2002, WMAN.

[17]  Shivakant Mishra,et al.  Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks , 2004, International Conference on Dependable Systems and Networks, 2004.

[18]  Noel A Cressie,et al.  Statistics for Spatial Data. , 1992 .

[19]  N. Asokan,et al.  Securing ad hoc routing protocols , 2002, WiSE '02.

[20]  Samir R Das,et al.  Ad hoc on-demand multipath distance vector routing , 2002, MOCO.

[21]  Christian Bettstetter,et al.  Mobility modeling in wireless networks: categorization, smooth movement, and border effects , 2001, MOCO.

[22]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[23]  Srdjan Capkun,et al.  SECTOR: secure tracking of node encounters in multi-hop wireless networks , 2003, SASN '03.

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

[25]  Mike Rees,et al.  5. Statistics for Spatial Data , 1993 .

[26]  Edward W. Knightly,et al.  Denial of service resilience in ad hoc networks , 2004, MobiCom '04.

[27]  Robin Kravets,et al.  Bypass routing: An on-demand local recovery protocol for ad hoc networks , 2006, Ad Hoc Networks.

[28]  Hannes Hartenstein,et al.  Stochastic Properties of the Random Waypoint Mobility Model , 2004, Wirel. Networks.

[29]  David Evans,et al.  Using Directional Antennas to Prevent Wormhole Attacks , 2004, NDSS.

[30]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[31]  Paramvir Bahl,et al.  Wake on wireless: an event driven energy saving strategy for battery operated devices , 2002, MobiCom '02.

[32]  Yih-Chun Hu,et al.  Rushing attacks and defense in wireless ad hoc network routing protocols , 2003, WiSe '03.

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

[34]  Dawn Song,et al.  The TESLA Broadcast Authentication Protocol , 2002 .