A rigorous analysis of AODV and its variants
Peter Höfner, Rob Van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle K. McIver, Ansgar Fehnker · 2012
In this paper we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol usingaformal specification inAWN(Algebrafor Wireless Networks), aprocess algebrawhichhas beenspecifically 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 providinga detailed proof of loop freedom. In contrast to evaluations using simulation or otherformal methods suchas model checking, our proofis 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.