![]() |
SAODV: Secure AODV and
|
|
Softcover: 112 pages. Publisher: VDM Date: April 2008 Language: English ISBN-10: 363900907X ISBN-13: 978-3639009071 Dimensions: 22 x 15 x 0,7 cm You can buy it from: Amazon.com |
The Secure Ad hoc On-Demand Distance Vector (SAODV) is an extension of the AODV routing protocol that can be used to protect the route discovery mechanism providing security features like integrity and authentication.
@Misc{Guerrero2006saodv06,
author = {Guerrero-Zapata, Manel},
title = {Secure Ad hoc On-Demand Distance Vector (SAODV) Routing},
institution = {Technical University of Catalonia (UPC)},
year = 2006,
month = Sep,
day = 5,
note = {INTERNET-DRAFT draft-guerrero-manet-saodv-06.txt},
}
The Simple Ad hoc Key Management (SAKM) is a key management system that allows to the nodes of an ad hoc network to use asymmetric cryptography with zero configuration. It is intended to be applied to MANET routing protocols that provide security features that require the use of asymmetric cryptography (like SAODV).
@Misc{Guerrero2006sakm01,
author = {Guerrero-Zapata, Manel},
title = {Simple Ad hoc Key Management (SAKM)},
institution = {Technical University of Catalonia (UPC)},
year = 2006,
month = Sep,
day = 5,
note = {INTERNET-DRAFT draft-guerrero-manet-sakm-01.txt},
}
The Secure Dynamic MANET On-Demand (SDYMO) Routing Protocol is an extension of the DYMO routing protocol that can be used to protect the route discovery mechanism providing security features like integrity and authentication.
@Misc{Guerrero2006sakm00,
author = {Guerrero-Zapata, Manel},
title = {Secure Dynamic MANET On-Demand (SDYMO) Routing Protocol},
institution = {Technical University of Catalonia (UPC)},
year = 2006,
month = Feb,
day = 7,
note = {INTERNET-DRAFT draft-guerrero-manet-sdymo-00.txt},
}
When a routing protocol for manet networks (mobile and ad hoc networks) does a route discovery, it does not discover the shortest route but the route through which the route request flood traveled faster. In addition, since nodes are moving, a route that was the shortest one at discovery time might stop being so in quite a short period of time. This causes, not only a much bigger end-to-end delay, but also more collisions and a faster power consumption. In order to avoid all the performance loss due to these problems, this paper develops a technique to periodically discover shortcuts to the active routes that can be used with any destination vector routing protocol. It also shows how the same mechanism can be used as a bidirectional route recovery mechanism.
@InProceedings{Guerrero2005Percomw,
author = "Guerrero-Zapata, Manel",
title = "{Shortcut Detection and Route Repair in Ad-hoc Networks}",
booktitle = "{In Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'05)}",
month = "March",
year = "2005"
}
MANET (mobile and ad hoc networks) are networks in which nodes are mobile and link connectivity might change all the time. In this kind of networks key management is an important and complex problem. This paper studies how to design key management schemes for such networks that will allow to identify nodes without the need of any kind of certification authority. In addition, it presents a method to reduce the delays in route establishment in cases where routing messages are signed and need to be verified. Finally, it applies all these to SAODV (an extension of the AODV MANET routing protocol that protects the route discovery mechanism providing security features like integrity and authentication), and presents results from simulations that show how this method provides the same security with minimum impact in the network performance. Therefore, providing a more complete solution to the problem of security in MANET networks.
@InProceedings{Guerrero2004Tiw,
author = "Guerrero-Zapata, Manel",
title = "{Key Management and Delayed Verification for Ad Hoc Networks}",
booktitle = "{In Proceedings of HiPC Workshops 2004, Electronic proceedings, Trusted Internet Workshop, paper \#8, 8 pages}",
month = "December",
year = "2004"
}
We consider the problem of incorporating security mechanisms into routing protocols for ad hoc networks. Canned security solutions like IPSec are not applicable. We look at AODV in detail and develop a security mechanism to protect its routing information. We also briefly discuss whether our techniques would also be applicable to other similar routing protocols and about how a key management scheme could be used in conjunction with the solution that we provide.
@InProceedings{Guerrero2002WiSe,
author = "Guerrero-Zapata, Manel and N. Asokan",
title = "{Securing Ad hoc Routing Protocols}",
booktitle = "{Proceedings of the 2002 ACM Workshop on Wireless Security (WiSe 2002)}",
pages = "1-10",
month = "September",
year = "2002"
}
This article gives an overview of different approaches to provide security features to routing protocols in mobile ad hoc networks (MANET). It also looks to Secure AODV (an extension to AODV that provides security features) giving a summary of its operation and talking about future enhancements to the protocol.
@Article{Guerrero2002MC2R,
author = "Guerrero-Zapata, Manel",
title = "{Secure Ad hoc On-Demand Distance Vector Routing}",
journal = "{ACM Mobile Computing and Communications Review (MC2R)}",
volume = "6",
number = "3",
pages = "106-107",
month = "July",
year = "2002"
}