ABSTRACT
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.
- I. Aad, J.-P. Hubaux, and E. W. Knightly. Denial of Service Resilience in Ad Hoc Networks. In ACM MOBICOM, pages 202--215, 2004.]] Google ScholarDigital Library
- B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens. An On-Demand Secure Routing Protocol Resilient to Byzantine Failures. In First ACM Workshop on Wireless Security (WiSe), pages 21--30, 2002.]] Google ScholarDigital Library
- C. Bettstetter. Mobility Modeling in Wireless Networks: Categorization, Smooth Movement, and Border Effects. ACM Mobile Computing and Communication Review, 5(3):55--67, 2001.]] Google ScholarDigital Library
- C. Bettstetter, H. Hartenstein, and X. Perez-Costa. Stochastic Properties of the Random Waypoint Mobility Model. ACM/Kluwer Wireless Networks, Special Issue on Modeling and Analysis of Mobile Networks, 10(5):555--567, 2004.]] Google ScholarDigital Library
- C. Bettstetter and C. Wagner. The Spatial Node Distribution of the Random Waypoint Mobility Model. In German Workshop on Mobile Ad Hoc Networks (WMAN), pages 41--58, 2002.]] Google ScholarDigital Library
- S. Brands and D. Chaum. Distance-Bounding Protocols (Extended Abstract). In T. Helleseth, editor, EUROCRYPT'93, Lecture Notes in Computer Science 765, pages 344--359, 1993.]] Google ScholarDigital Library
- N. Cressie. Statistics for Spatial Data. John Wiley and Sons, 1993.]]Google Scholar
- J. Deng, R. Han, and S. Mishra. Intrusion Tolerance and Anti-Traffic Analysis Strategies for Wireless Sensor Networks. In IEEE International Conference on Dependable Systems and Networks (DSN), pages 594--603, 2004.]] Google ScholarDigital Library
- J. Douceur. The Sybil Attack. In Proceedings of the 1st International Peer To Peer Systems Workshop (IPTPS 2002), 2002.]] Google ScholarDigital Library
- L. M. Feeney and M. Nilsson. Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment. In IEEE INFOCOM, 2001.]]Google ScholarCross Ref
- L. Hu and D. Evans. Using Directional Antennas to Prevent Wormhole Attacks. In Network and Distributed System Security Symposium (NDSS), 2004.]]Google Scholar
- Y.-C. Hu, A. Perrig, and D. B. Johnson. Ariadne: A Secure On-demand Routing Protocol for Ad Hoc Networks. In ACM MOBICOM, pages 12--23, 2002.]] Google ScholarDigital Library
- Y.-C. Hu, A. Perrig, and D. B. Johnson. Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks. In IEEE INFOCOM, 2003.]]Google ScholarCross Ref
- Y.-C. Hu, A. Perrig, and D. B. Johnson. Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols. In ACM WiSe'03 in conjunction with MOBICOM'03, pages 30--40, 2003.]] Google ScholarDigital Library
- D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In T. Imielinski and H. Korth, editors, Mobile Computing, volume 353, pages 153--181. Kluwer Academic Publishers, 1996.]]Google Scholar
- D. B. Johnson and D. A. Maltz. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR), April 2003.]]Google Scholar
- J. Kong, X. Hong, J.-S. Park, Y. Yi, and M. Gerla. L'Hospital: Self-healing Secure Routing for Mobile Ad-hoc Networks. Technical Report CSD-TR040055, Dept. of Computer Science, UCLA, January 2005.]]Google Scholar
- M. K. Marina and S. R. Das. Ad Hoc On-demand Multipath Distance Vector Routing. In IEEE ICNP, pages 14--23, 2001.]] Google ScholarDigital Library
- S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In ACM MOBICOM, 2000.]] Google ScholarDigital Library
- P. Papadimitratos and Z. J. Haas. Secure Routing for Mobile Ad Hoc Networks. In SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), 2002.]]Google ScholarDigital Library
- P. Papadimitratos and Z. J. Haas. Secure Data Transmission in Mobile Ad Hoc Networks. In Second ACM Workshop on Wireless Security (WiSe), pages 41--50, 2003.]] Google ScholarDigital Library
- C. E. Perkins and E. M. Royer. Ad-Hoc On-Demand Distance Vector Routing. In IEEE WMCSA'99, pages 90--100, 1999.]] Google ScholarDigital Library
- C. E. Perkins, E. M. Royer, and S. Das. Ad-hoc On Demand Distance Vector (AODV) Routing. http://www.ietf.org/rfc/rfc3561.txt, July 2003.]] Google ScholarDigital Library
- A. Perrig, R. Canetti, D. Tygar, and D. Song. The TESLA Broadcast Authentication Protocol. RSA CryptoBytes, 5(2):2--13, 2002.]]Google Scholar
- G. Resta and P. Santi. An Analysis of the Node Spatial Distribution of the Random Waypoint Model for Ad Hoc Networks. In ACM Workshop on Principles of Mobile Computing (POMC), pages 44--50, 2002.]] Google ScholarDigital Library
- P. Sambasivam, A. Murthy, and E. M. Belding-Royer. Dynamically Adaptive Multipath Routing based on AODV. In Med-Hoc-Net, 2004.]]Google Scholar
- K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, and E. Royer. A Secure Routing Protocol for Ad Hoc Networks. In 10th International Conference on Network Protocols (IEEE ICNP'02), 2002.]] Google ScholarDigital Library
- Scalable Network Technologies (SNT). QualNet. http://www.qualnet.com/.]]Google Scholar
- C. Sengul and R. Kravets. Bypass Routing: An On-Demand Local Recovery Protocol for Ad Hoc Networks. In Med-Hoc-Net, 2004.]] Google ScholarDigital Library
- E. Shih, P. Bahl, and M. Sinclair. Wake on Wireless: An Event Driven Energy Saving Strategy for Battery Operated Devices. In ACM MOBICOM, pages 160--171, 2002.]] Google ScholarDigital Library
- S. Čapkun, L. Buttyán, and J.-P. Hubaux. SECTOR: Secure Tracking of Node Encounters in Multi-hop Wireless Networks. In ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), pages 21--32, 2003.]] Google ScholarDigital Library
- J. Yoon, M. Liu, and B. Noble. Sound Mobility Models. In ACM MOBICOM, pages 205--216, 2003.]] Google ScholarDigital Library
- M. G. Zapata and N. Asokan. Securing Ad Hoc Routing Protocols. In First ACM Workshop on Wireless Security (WiSe), pages 1--10, 2002.]] Google ScholarDigital Library
Index Terms
- A secure ad-hoc routing approach using localized self-healing communities
Recommendations
A Survey of Secure Wireless Ad Hoc Routing
Ad hoc networks use mobile nodes to enable communication outside wireless transmission range. Attacks on ad hoc network routing protocols disrupt network performance and reliability. The authors survey the state of research and its challenges in this ...
Connectionless protocol: a localised approach to wireless ad hoc networks
Most mobile ad hoc network's communication techniques need to discover routes and establish a connection before they can communicate. This strategy cannot robustly adapt to frequent unpredictable topology changes due to high mobility. Constant ...
Low Overhead Localized Routing in Mobile Ad Hoc Networks
Mobile Opportunistic Networks (OppNets) are infrastructure-less networks consisting of wireless mobile nodes and have been a focus of research for years. OppNets can be scaled up to support rapid growth of wireless devices and technologies, ...
Comments