A rigorous analysis of AODV and its variants

  • Authors:

  • Peter Höfner;Robert J. van Glabbeek;Wee Lum Tan;Marius Portmann;Annabelle McIver;Ansgar Fehnker

  • Affiliations:

  • NICTA, Sydney, Australia;NICTA, Sydney, Australia;NICTA, Brisbane, Australia;NICTA, Brisbane, Australia;Macquarie University, Sydney, Australia;NICTA, Sydney, Australia

  • Venue:
  • Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 about critical protocol correctness properties by providing a detailed proof of loop freedom. In contrast to evaluations using simulation or other formal methods such as model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, traffic pattern, etc. A key contribution of this paper is the demonstration of how the reasoning and proofs can relatively easily be adapted to protocol variants.