DocumentCode
3127357
Title
Secure on-demand distance vector routing in ad hoc networks
Author
Papadimitratos, Panagiotis ; Haas, Zygmunt J.
Author_Institution
Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA
fYear
2005
fDate
18-19 April 2005
Firstpage
168
Lastpage
171
Abstract
We address the problem of securing route discovery in mobile ad hoc networks, proposing a lightweight, yet robust, routing protocol, the distance-vector secure routing protocol (DV-SRP). DV-SRP discovers on-demand multiple routes, which are established across the network, without explicitly providing network connectivity. DV-SRP combines the advantages of the type of route discovery first introduced by AODV, with security and, thus, resilience to adversaries that disrupt route discovery. Compared to previous proposals in the literature to secure the AODV-like route discovery, DV-SRP is either more robust, or more efficient, or more general
Keywords
ad hoc networks; mobile radio; routing protocols; telecommunication security; distance-vector secure routing protocol; mobile ad hoc networks; on-demand multiple route discovery; secure on-demand distance vector routing; Ad hoc networks; Computer networks; Intelligent networks; Mobile ad hoc networks; Peer to peer computing; Proposals; Public key cryptography; Robustness; Routing protocols; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Advances in Wired and Wireless Communication, 2005 IEEE/Sarnoff Symposium on
Conference_Location
Princeton, NJ
Print_ISBN
0-7803-8854-2
Type
conf
DOI
10.1109/SARNOF.2005.1426537
Filename
1426537
Link To Document