A rigorous analysis of AODV and its variants

Hofner, P. and van Glabbeek, R.J. and Tan, W.L. and Portmann, M. and McIver, A. and Fehnker, Ansgar (2012) A rigorous analysis of AODV and its variants. [Conference Proceedings]

Preview

PDF - Accepted Version Download (256kB) | Preview

Abstract

In this paper we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol using a formal specification in AWN (Algebra for Wireless Networks), a process algebra which has been specifically 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 correctness properties by providing a detailed proof of loop freedom. In contrast to evaluations using simulation or other formal methods such as model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, traffic pattern, etc. A key contribution of this paper is the demonstration of how the reasoning and proofs can relatively easily be adapted to protocol variants.

Item Type:	Conference Proceedings
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Faculty of Science, Technology and Environment (FSTE) > School of Computing, Information and Mathematical Sciences
Depositing User:	Ansgar Fehnker
Date Deposited:	01 May 2013 03:41
Last Modified:	21 Jul 2016 02:45
URI:	http://repository.usp.ac.fj/id/eprint/5731

UNSPECIFIED

Actions (login required)

View Item