# A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV

@article{Fehnker2013APA, title={A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV}, author={Ansgar Fehnker and Rob J. van Glabbeek and Peter H{\"o}fner and Annabelle McIver and Marius Portmann and Wee Lum Tan}, journal={ArXiv}, year={2013}, volume={abs/1312.7645} }

We propose AWN (Algebra for Wireless Networks), a process algebra tailored to the modelling of Mobile Ad hoc Network (MANET) and Wireless Mesh Network (WMN) protocols. It combines novel treatments of local broadcast, conditional unicast and data structures.
In this framework we present a rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) protocol, a popular routing protocol designed for MANETs and WMNs, and one of the four protocols currently standardised by the IETF MANET… Expand

#### Figures, Tables, and Topics from this paper

#### 55 Citations

A rigorous analysis of AODV and its variants

- Computer Science
- MSWiM '12
- 2012

A rigorous analysis of the Ad hoc On-Demand Distance Vector 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. Expand

Modelling and verifying the AODV routing protocol

- Computer Science
- Distributed Computing
- 2015

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… Expand

Modeling and efficient verification of wireless ad hoc networks

- Computer Science
- Formal Aspects of Computing
- 2017

An actor-based modeling language is presented with the aim to model MANETs and it is illustrated the applicability of the framework through two routing protocols, namely flooding and AODVv2-11, and how efficiently their state spaces can be reduced by the proposed techniques. Expand

Formal Analysis of Network Routing Protocols

- Computer Science
- 2019

The objective of this dissertation is to study different routing protocols of wireless mesh networks using formal techniques as well as to propose a generic framework to formally model, analyse and verify such protocols as the ultimate goal. Expand

A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)

- Computer Science
- ESOP
- 2016

This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast and data… Expand

Mechanization of the Algebra for Wireless Networks (AWN)

- Computer Science
- Arch. Formal Proofs
- 2014

This development mechanises the original operational semantics of AWN and introduces a variant 'open' operational semantics that enables the compositional statement and proof of invariants across distinct network nodes. Expand

Loop freedom of the (untimed) AODV routing protocol

- Computer Science
- Arch. Formal Proofs
- 2014

This development mechanises an existing pen-and-paper proof of loop freedom of AODV and shows that Isabelle/HOL can re-establish most proof obligations automatically and identify exactly the steps that are no longer valid. Expand

Automated Analysis of AODV Using UPPAAL

- Computer Science
- TACAS
- 2012

An automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector routing protocol, a popular protocol used in wireless mesh networks, using the UPPAAL model checker to automatically locate problematic and undesirable behaviours. Expand

Towards a rigorous analysis of AODVv2 (DYMO)

- Computer Science
- 2012 20th IEEE International Conference on Network Protocols (ICNP)
- 2012

This paper presents a formal model of AODVv2, using the process algebra AWN, and concludes that AODvv2 is not necessarily better than A ODV. Expand

A Formal Framework for Mobile Ad hoc Networks in Real-Time Maude

- Computer Science
- 2017

A formal executable and parameterized modeling framework for MANETs in Real-Time Maude that integrates several mobility models and wireless communication is presented. Expand

#### References

SHOWING 1-10 OF 83 REFERENCES

A rigorous analysis of AODV and its variants

- Computer Science
- MSWiM '12
- 2012

A rigorous analysis of the Ad hoc On-Demand Distance Vector 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. Expand

A Timing Analysis of AODV

- Computer Science
- FMOODS
- 2005

This work considers the Ad hoc On Demand Distance Vector protocol, a reactive protocol currently undergoing standardisation at the IETF (RFC3561), and applies the real-time model checker Uppaal to consider the effect of the protocol parameters on the timing behaviour of AODV, thus complementing the earlier untimed verification effort. Expand

Modeling and simulation of routing protocol for mobile ad hoc networks using colored petri nets

- Computer Science
- FME 2002
- 2002

A topology approximation (TA) mechanism is proposed to address the problem of mobility and simulations of a typical routing protocol called Ad Hoc On-Demand Distance Vector Routing (AODV) show that the proposed TA mechanism can indeed mimic the dynamically changing graph (mobility) of a MANET. Expand

A process calculus for Mobile Ad Hoc Networks

- Computer Science
- Sci. Comput. Program.
- 2010

A formal operational semantics of the @w-calculus is given in terms of labeled transition systems and it is proved that the state reachability problem is decidable for finite-control @w -processes and that late bisimulation equivalence is a congruence. Expand

A Proces-Algebraic Framework for Estimating the Energy Consumption in Ad-hoc Wireless Sensor Networks

- 2013

We present a framework for modelling ad-hoc Wireless Sensor Networks (WSNs) and studying both their connectivity properties and their performance in terms of energy consumption, throughput and other… Expand

Verification of mobile ad hoc networks: An algebraic approach

- Computer Science
- Theor. Comput. Sci.
- 2011

Model checking and equational reasoning together provide us with an appropriate framework to prove the correctness of MANETs and the applicability of the framework is demonstrated by a case study on a simple routing protocol. Expand

Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks

- Computer Science
- Petri Nets
- 2008

A Coloured Petri Net (CPN) model of the mandatory parts of the DYMO protocol is presented, and how scenario-based state space exploration has been used to validate key properties of the protocol is shown. Expand

A process calculus for energy-aware multicast communications of mobile ad hoc networks

- Computer Science
- Wirel. Commun. Mob. Comput.
- 2013

The E-BUM calculus is presented, an Energy-aware calculus for Broadcast, Unicast and Multicast communications of MANETs, which formalizes the notions of sender-centred and receiver- Centred interference and provides efficient proof techniques for verifying the absence of interference between a specific set of nodes. Expand

Topology-Based Mobility Models for Wireless Networks

- Computer Science
- QEST
- 2013

A topology-based mobility model is proposed, that abstracts from physical behaviour, and models mobility as probabilistic changes in the topology, and can be instantiated to cover the main aspects of the random walk and the random waypoint mobility model. Expand

Towards a rigorous analysis of AODVv2 (DYMO)

- Computer Science
- 2012 20th IEEE International Conference on Network Protocols (ICNP)
- 2012

This paper presents a formal model of AODVv2, using the process algebra AWN, and concludes that AODvv2 is not necessarily better than A ODV. Expand