Modelling and verifying the AODV routing protocol

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

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

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.
Original languageEnglish
Pages (from-to)279-315
Number of pages37
JournalDistributed Computing
Volume29
Issue number4
Early online date4 Mar 2016
DOIs
Publication statusPublished - 1 Aug 2016

Keywords / Materials (for Non-textual outputs)

  • Wireless mesh networks
  • Mobile ad-hoc networks
  • Routing protocols
  • AODV
  • Process algebra
  • AWN
  • Loop freedom

Fingerprint

Dive into the research topics of 'Modelling and verifying the AODV routing protocol'. Together they form a unique fingerprint.

Cite this