Modelling and Verifying the AODV Routing Protocol
arXiv:1512.08867 · doi:10.1007/s00446-015-0262-7
Abstract
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.
arXiv admin note: substantial text overlap with arXiv:1312.7645
References in corpus (6)
- A Process Algebra for Wireless Mesh Networks
- Automated Analysis of AODV using UPPAAL
- Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops
- A mechanized proof of loop freedom of the (untimed) AODV routing protocol
- A Rigorous Analysis of AODV and its Variants
- Showing invariance compositionally for a process algebra for network protocols