Skip to main content


A rigorous analysis of AODV and its variants


Peter Hoefner, Rob van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver and Ansgar Fehnker



University of Queensland

Macquarie University


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.

BibTeX Entry

    publisher        = {ACM},
    doi              = {10.1145/2387238.2387274},
    author           = {Höfner, Peter and van Glabbeek, Robert and Tan, Wee Lum and Portmann, Marius and McIver, Annabelle
                        and Fehnker, Ansgar},
    month            = {oct},
    editor           = {{A.Y. Zomaya, B. Landfeldt and R. Prakash}},
    year             = {2012},
    keywords         = {aodv; loop freedom; process algebra; routing protocols; wireless mesh networks},
    title            = {A Rigorous Analysis of {AODV} and its Variants},
    booktitle        = {15th ACM/IEEE International Conference on Modelling, Analysis and Simulation of Wireless and Mobile
                        Systems (MSWIM 2012)},
    pages            = {203-212},
    address          = {Paphos, Cyprus}