A rigorous analysis of AODV and its variants

@inproceedings{Hfner2012ARA,
  title={A rigorous analysis of AODV and its variants},
  author={Peter H{\"o}fner and Rob J. van Glabbeek and Wee Lum Tan and Marius Portmann and Annabelle McIver and Ansgar Fehnker},
  booktitle={MSWiM '12},
  year={2012}
}
In this paper we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol using a formal specification in AWN (Algebra for Wireless Networks), a process algebra which has been specifically tailored for the modelling of Mobile Ad Hoc Networks and Wireless Mesh Network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason… 

Figures and Tables from this paper

Modelling and verifying the AODV routing protocol
This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailored
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
TLDR
A rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group is presented.
Towards a rigorous analysis of AODVv2 (DYMO)
TLDR
This paper presents a formal model of AODVv2, using the process algebra AWN, and concludes that AODvv2 is not necessarily better than A ODV.
Loop Freedom in AODVv 2
TLDR
This work details two scenarios that show how routing loops may form in AODVv2 routing tables and presents an inductive and compositional proof showing that the corrected core protocol is loop-free for all valid configurations.
Loop Freedom in AODVv2
TLDR
This work details two scenarios that show how routing loops may form in AODVv2 routing tables and presents an inductive and compositional proof showing that the corrected core protocol is loop-free for all valid configurations.
Comparing Routing Protocols
  • M. Kamali, L. Petre
  • Computer Science
    2015 20th International Conference on Engineering of Complex Computer Systems (ICECCS)
  • 2015
TLDR
This work aims at formally defining properties that can be used as metrics (measurements) for routing protocols and compares AODV and OLSR protocols to evaluate the measurements.
Quantitative Analysis of AODV and Its Variants on Dynamic Topologies Using Statistical Model Checking
TLDR
Statistical Model Checking can overcome the problem of network size and topology changes and allow a quantitative analysis of WMNs.
Sequence numbers do not guarantee loop freedom: AODV can yield routing loops
TLDR
It is shown that AODV is not a priori loop free; in fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
TLDR
A rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET working group is presented.
AODV routing protocol implementation design
  • I. Chakeres, E. Belding-Royer
  • Computer Science
    24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings.
  • 2004
TLDR
The event triggers required for AODV operation, the design possibilities and the decisions for the ad hoc on-demand distance vector routing protocol implementation, A ODV-UCSB are described.
The proof of AODV loop freedom
TLDR
This paper gives a formal description of the AODV protocol and presents a strictly formal proof of its loop freedom property in Isabelle/HOL, demonstrating the feasibility of completely formal verification of some properties of routing protocols with reasonable effort.
System Services for Ad-Hoc Routing: Architecture, Implementation and Experiences
TLDR
This work proposes an architecture and a generic API for any operating system to augment the current routing architecture and provides a full-fledged implementation of the AODV protocol using ASL, and a design for the DSR protocol.
Formal verification of standards for distance vector routing protocols
TLDR
This work shows how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols, and develops verification techniques suited to routing protocols generally.
Sequence numbers do not guarantee loop freedom: AODV can yield routing loops
TLDR
It is shown that AODV is not a priori loop free; in fact, loop freedom hinges on non-evident assumptions to be made when resolving ambiguities occurring in the RFC.
Ad-hoc on-demand distance vector routing
  • C. Perkins, E. Belding-Royer
  • Computer Science
    Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
TLDR
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
We present a technique for modeling and automatic verification of network protocols, based on graph transformation. It is suitable for protocols with a potentially unbounded number of nodes, in which
Automatized Verification of Ad Hoc Routing Protocols
TLDR
Two model checking tools, SPIN and UPPAAL, are evaluated using the verification of the Lightweight Underlay Network Ad hoc Routing protocol (LUNAR) as a case study, identifying important modeling considerations and the types of ad hoc protocol properties that can realistically be verified.
Performance analysis of multi-radio AODV in hybrid wireless mesh networks
...
...