In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The proposed approach is an adaptation of the simulation paradigm that is used extensively for the analysis of cryptographic algorithms and protocols, and it provides a rigorous method for proving that a given routing protocol is secure. We demonstrate the approach by representing known and new attacks on SAODV in our framework, and by proving that ARAN is secure in our model.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Provable Security of On-Demand Distance Vector Routing in Wireless Ad Hoc Networks
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA