Loop freedom of the (untimed) AODV routing protocol - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Other Publications Year : 2014

Loop freedom of the (untimed) AODV routing protocol


The Ad hoc On-demand Distance Vector (AODV) routing protocol allows the nodes in a Mobile Ad hoc Network (MANET) or a Wireless Mesh Network (WMN) to know where to forward data packets. Such a protocol is ‘loop free’ if it never leads to routing decisions that forward packets in circles.This development mechanises an existing pen-and-paper proof of loop freedom of AODV. The protocol is modelled in the Algebra of Wireless Networks (AWN), which is the subject of an earlier paper and AFP mechanization. The proof relies on a novel compositional approach for lifting invariants to networks of nodes.We exploit the mechanization to analyse several variants of AODV and show that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid.
Fichier principal
Vignette du fichier
document-2.pdf (1.19 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01104033 , version 1 (15-01-2015)


  • HAL Id : hal-01104033 , version 1


Timothy Bourke, Peter Höfner. Loop freedom of the (untimed) AODV routing protocol. 2014, pp.496. ⟨hal-01104033⟩
196 View
163 Download


Gmail Facebook Twitter LinkedIn More