WIRELESS NETWORK SECURITY 157 6 SUMMARY

Ad-hoc networks are potential enablers of networking any-where and any-time concept, which is the current trend in this information-sharing age. While these net- works are rapidly deployable and do not need an infrastructure to operate, they are very vulnerable to attacks from both inside and outside of the network. As explained in this chapter, even the fundamental task of routing becomes non-trivial in presence of malicious node. Especially, when the number of malicious nodes cross beyond certain threshold, routing becomes impossible. Another extreme is a case where there is a single malicious node that connects two part of the network. In such cases, excluding malicious node renders the network partitioned in to two or parts. In this chapter, we presented a brief description of routing protocols for ad-hoc networks, possible attacks of routing protocols, and various secure routing protocols that establish secure paths from a source to the destination. Further, we discussed some security counter measures for position-based routing. Secure routing in ad-hoc network, as of now, is an active area of research. Coming up with an efficient and secure routing protocol under a robust security model with provable security is still an open problem.

7.

1. Baruch Awerbuch, David Holmer, Cristina Nita Rotaru and Herbert Rubens. An On Demand Secure Routing Protocol Resilient to Byzantine Failures.In ACM Workshop on Wireless Security (WiSe), Atlanta, Georgia, September 28 2002.

2. Sonja Buchegger and Jean-Yves Le Boudec. Performance Analysis of the CONFIDANT Protocol (Cooperation Of Nodes: Fairness In Dynamic Ad-hoc NeTworks).In proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing (MOBIHOC) 2002. Lausanne, Switzerland.

3. S. Basagni, I. Chlamtac, V. Syroutik, and B. Woodward. A distance effect routing algorithm for mobility (DREAM).In proceedings of the 4th annual ACM/IEEE Int. Conf. on Mobile Computing and networking (MOBICOM), pages 76-84, Dallas, TX, USA, 1998.

4. Levente Buttyán and Jean-Pierre Hubaux. Stimulating cooperation in self-organizing mobile ad hoc networks.Mob. Netw. Appl.,8(5), 579–592, Kluwer Academic Publishers 2003.

5. Prosenjit Bose, Pat Morin, Ivan Stojmenovic, and Jorge Urrutia. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks.Wireless Networksi7, 609-616, Kluwer Academic Publishers 2001. 6. http://www.bluetooth.com

7. Yih-Chun Hu, David B. Johnson and Adrian Perrig, SEAD: Secure Efficient Distance Vector Routing in Mobile Wireless Ad-hoc Networks.Fourth IEEE Workshop on Mobile Computing Systems and Applications WMCSA ’02.

8. Yih-Chun Hu, Adrian Perrig and David B. Johnson. Ariadne: A secure on-demand routing protocol for ad-hoc networks.The 8th ACM International Conference on Mobile Computing and Networking, September 2002.

9. Z. Haas and M. Pearlman. The performance of query control scheme for the zone routing protocol.

ACM/IEEE Transactions on Networking, 9(4) pages 427-438, August 2001.

10. P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, L. Viennot. Optimized Link State Routing Protocol.IEEE INMIC Pakistan 2001.

158 VENKATA C. GIRUKA and MUKESH SINGHAL

11. D. Johnson and D. Maltz. Mobile Computing.chapter 5. Dynamic Source Routing, pages 153-181. Kulwer Academic Publishers, 1996.

12. Karp, B., and Kung. H. T. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks.Proc. 6th Annual International Conference on Mobile Computing and Networking(MOBICOM 2000), 243-254. 13. Young-Bae Ko , Nitin H. Vaidya. Location-aided routing (LAR) in mobile ad-hoc networks.

ACM/Blatzer Wireless Networks journal, 6(4) pages 307-321, 2000.

14. Chris Karlof and David Wagner. Secure routing in sensor networks: Attacks and countermeasures.

In Proceedings of the IEEE International Workshop on Sensor Network Protocols and Applications (SNPA-03), May 2003.

15. Jinyang Li, John Jannotti, Douglas S. J. De Couto, David R. Karger, Robert Morris. A Scalable Location Service for Geographic Ad Hoc Routing.Proceedings of 6th ACM International Conference on Mobile Computing and Networking (MOBICOM)2000.

16. National Institute of Standards and Technology (NIST). Secure Hash Standard, May 1993.Federal Information Processing Standards (FIPS) Publication 180-1.

17. C.Perkins and P. Bhagwat. Highly dynamic destination sequenced distance-vector routing for mobile computers.Computer Communication Review, pages 234-244, October 94.

18. Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast.In Network and Distributed System Security Symposium, NDSS 01, pages 35-46, February 2001.

19. P.Papadimitratos and Z.J. Haas. Secure Routing for Mobile Ad hoc Networks.In the proceedings of SCS Communication Networks and Distributed Systems Modeling And Simulation Conference (CNDS 2002), San Antonio, TX, January 27-31, 2002.

20. C. Perkins and E. Royer. Ad-hoc on-demand distance vector routing.In Proc. Of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90-100, Feb 1999.

21. Ronald L. Rivest. The MD5 Message-Digest Algorithm.RFC 1321, April 1992.

22. Michael Käsemann, Holger Füßler, Hannes Hartenstein, Martin Mauve. A Reactive Location Service for Mobile Ad Hoc Networks.TR-14-2002, Department of Computer Science, University of Mannheim, November 2002.

23. http://www.terminodes.org

24. K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, E.M. Belding-Royer. An Authenticated Routing Protocol for Secure Ad Hoc Networks.IEEE Journal on Selected Areas in Communication, special issue on Wireless Ad hoc Networks, 23(3)pages 598-610, March 2005.

25. Ning Song, Lijun Qian, Xiangfang Li. Wormhole Attacks Detection in Wireless Ad Hoc Networks: A Statistical Analysis Approach.19th IEEE International Parallel and Distributed Processing Symposium (IPDPS’05)- Workshop 17, 2005.

26. Ivan Stojmenovic. Position based routing in ad-hoc networks.IEEE Communications Magazine,40(7), pages 128-134, 2002.

27. Y Xue, B Li and K Nahrstedt. A scalable location management scheme in mobile ad-hoc networks.

26th Annual IEEE Conference on Local Computer Networks(LCN 2001).

28. Yongwei Wang, Venkata C. Giruka and Mukesh Singhal. A Fair Distributed Solution for Selfish Nodes Problem in Wireless Ad Hoc Networks.In Proceedings of Third International Conference, ADHOC- NOW 2004,Vancouver, Canada, July 22-24, 2004. Proceedings.

29. Zhi Zhou and Kin Choong Yow. Geographic Ad Hoc Routing Security: Attacks and Countermeasures.

7

A SURVEY ON INTRUSION DETECTION IN