pith. sign in

arxiv: 1512.08867 · v1 · pith:3MSOPPPYnew · submitted 2015-12-30 · 💻 cs.NI · cs.LO

Modelling and Verifying the AODV Routing Protocol

classification 💻 cs.NI cs.LO
keywords aodvprotocolroutealgebramodellingnetworksroutingwireless
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.