Modelling and verifying the AODV routing protocol
Author(s)
van Glabbeek, Rob
Hofner, Peter
Portmann, Marius
Tan, Wee Lum
Griffith University Author(s)
Year published
2016
Metadata
Show full item recordAbstract
This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been 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 properties by providing detailed proofs of loop freedom and route correctness.This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been 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 properties by providing detailed proofs of loop freedom and route correctness.
View less >
View less >
Journal Title
Distributed Computing
Volume
29
Issue
4
Subject
Distributed computing and systems software
Networking and communications
Wireless mesh networks
Mobile ad-hoc networks
Routing protocols
AODV
Process algebra
AWN
Loop freedom