Securing AODV Routing Protocol in Mobile Ad-Hoc Networks
Paper in proceeding, 2009

In this paper, we have proposed a security scheme for Ad-hoc On-Demand Distance Vector (AODV) routing protocol. In this scheme, 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 scheme 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 scheme needs less computation power in routing transactions and does not need any centralized element in mobile ad-hoc networks.


Phu Phung

Chalmers, Computer Science and Engineering (Chalmers)

Myeongjae Yi

Myung-Kyun Kim

Active and Programmable Networks - IWAN 2005, LNCS Vol. 4388/2009

978-3-642-00971-6 (ISBN)

Subject Categories

Computer and Information Science



More information