Formal Analysis of AODV Using Rely-Guarantee

Mobile Ad-hoc Networks (MANETs) are increasingly deployed in infrastructureless scenarios. Routing protocol is a crucial solution for MANETs to establish network connections. This paper presents a formal description of the AODV routing protocol and analyzes its properties using relyguarantee method. In our approach the network is specified as a shared variable concurrent program, where communication is modelled by assignment on shared variables. Each parallel component of this program is a specification of route discovery process. The rely-guarantee method allows us to express and verify properties of the protocol on the basis of specifications of its constituent components.

[1]  Ming Zhou,et al.  The proof of AODV loop freedom , 2009, 2009 International Conference on Wireless Communications & Signal Processing.

[2]  Annabelle McIver,et al.  A Process Algebra for Wireless Mesh Networks , 2012, ESOP.

[3]  Edward W. Knightly,et al.  Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[5]  Willem P. de Roever,et al.  The rely-guarantee method for verifying shared variable concurrent programs , 1997, Formal Aspects of Computing.

[6]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[7]  Cliff B. Jones,et al.  Developing methods for computer programs including a notion of interference , 1981 .