Modelling and verifying the AODV routing protocol

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 mo...

Full description

Saved in:
Bibliographic Details
Published inDistributed computing Vol. 29; no. 4; pp. 279 - 315
Main Authors van Glabbeek, Rob, Höfner, Peter, Portmann, Marius, Tan, Wee Lum
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2016
Springer Nature B.V
Subjects
Algebra
Computer Communication Networks
Computer Hardware
Computer networks
Computer Science
Computer Systems Organization and Communication Networks
Maintenance
Mathematical analysis
Modelling
Routing (telecommunications)
Software Engineering/Programming and Operating Systems
Theory of Computation
Vectors (mathematics)
Wireless communication
Process algebra
Wireless mesh networks
AWN
Routing protocols
Mobile ad-hoc networks
Loop freedom
AODV
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0178-2770
1432-0452
DOI:10.1007/s00446-015-0262-7