Loop freedom of the (untimed) AODV routing protocol

Timothy Bourke 1, 2, 3 Peter Höfner 3, 4
2 Parkas - Parallélisme de Kahn Synchrone
CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria Paris-Rocquencourt, DI-ENS - Département d'informatique de l'École normale supérieure
Abstract : 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.
Liste complète des métadonnées

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01104033
Contributor : Timothy Bourke <>
Submitted on : Thursday, January 15, 2015 - 8:38:07 PM
Last modification on : Thursday, February 7, 2019 - 3:49:50 PM
Document(s) archivé(s) le : Friday, September 11, 2015 - 6:53:31 AM

File

document-2.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01104033, version 1

Collections

Citation

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

Share

Metrics

Record views

337

Files downloads

130