Securing AODV Routing Protocol in Mobile Ad-Hoc Networks
In this paper, we have proposed a security schema for Ad-hoc On-Demand Distance Vector (AODV) routing protocol. In this schema, each node in a network has a list of its neighbor nodes including a shared secret key which is obtained by executing a key agreement when joining a network. One key principle in our schema is that before executing route discovery steps in AODV protocol, each node executes message authentication process with the sender to guarantee the integrity and non-repudiation of routing messages and therefore, could prevent attacks from malicious nodes. Comparing with other recently proposed security routing protocols, our security schema needs less computation power in routing transactions and does not need any centralized element in mobile ad-hoc networks.
- 1.Charles, E.P., Elizabeth, M.R.: Ad hoc On-Demand Distance Vector Routing. In: Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, pp. 90–100 (1999)Google Scholar
- 2.Johnson, D., Maltz, D.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, T., Korth, H. (eds.) Mobile computing. Kluwer Academic Publ., Dordrecht (1996)Google Scholar
- 3.Refik, M., Pietro, M.: Security in ad hoc networks. In: Conti, M., Giordano, S., Gregori, E., Olariu, S. (eds.) PWC 2003. LNCS, vol. 2775, pp. 756–775. Springer, Heidelberg (2003)Google Scholar
- 5.Zapata, M.G., Asokan, N.: Securing Ad hoc Routing Protocols. In: Proc. of the ACM workshop on Wireless security, Atlanta, USA, pp. 1–10 (2002)Google Scholar
- 6.Man, Y.R.: Interner Security-cryptographic: principles, algorithms and protocols. Wiley Publishing House, Chichester (2004)Google Scholar
- 7.Panagiotis, P., Zygmunt, J.H.: Secure Routing for Mobile Ad hoc Networks. In: SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX (2002)Google Scholar