Modelling and Verifying the AODV Routing Protocol

Select |




Print


van Glabbeek, Robert; Höfner, Peter; Portmann, Marius; Tan, Wee Lum

van Glabbeek, Robert; Höfner, Peter; Portmann, Marius; Tan, Wee Lum


2016-08-01


Journal Article


Distributed Computing


29


4


279-315


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.


Wireless mesh networks; mobile ad-hoc networks; routing protocols; AODV; process algebra; AWN; loop freedom


https://doi.org/10.1007/s00446-015-0262-7


http://www.cse.unsw.edu.au/~rvg/pub/AODV.pdf


nicta:8491


van Glabbeek, Robert; Höfner, Peter; Portmann, Marius; Tan, Wee Lum. Modelling and Verifying the AODV Routing Protocol. Distributed Computing. 2016-08-01; 29(4):279-315. https://doi.org/10.1007/s00446-015-0262-7



Loading citation data...

Citation counts
(Requires subscription to view)