Modelling and Verifying the AODV Routing Protocol

December 30, 2015 Β· Declared Dead Β· πŸ› Distributed computing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rob van Glabbeek, Peter HΓΆfner, Marius Portmann, Wee Lum Tan arXiv ID 1512.08867 Category cs.NI: Networking & Internet Cross-listed cs.LO Citations 53 Venue Distributed computing Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Networking & Internet

Died the same way β€” πŸ‘» Ghosted