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

Abstract

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 working group. We give a complete and unambiguous specification of this protocol, thereby formalising the RFC of AODV, the de facto standard specification, given in English prose. In doing so, we had to make non-evident assumptions to resolve ambiguities occurring in that specification. Our formalisation models the exact details of the core functionality of AODV, such as route maintenance and error handling, and only omits timing aspects. The process algebra allows us to formalise and (dis)prove crucial properties of mesh network routing protocols such as loop freedom and packet delivery. We are the first to provide a detailed proof of loop freedom of AODV. In contrast to evaluations using simulation or model checking, our proof is generic and holds for any possible network scenario in terms of network topology, node mobility, etc. Due to ambiguities and contradictions the RFC specification allows several interpretations; we show for more than 5000 of them whether they are loop free or not, thereby demonstrating how the reasoning and proofs can relatively easily be adapted to protocol variants. Using our formal and unambiguous specification, we find shortcomings of AODV that affect performance, e.g. the establishment of non-optimal routes, and some routes not being found at all. We formalise improvements in the same process algebra; carrying over the proofs is again easy.

References in corpus (1)

• Modelling Probabilistic Wireless Networks

Cited by in corpus (10)

• A Process Algebra for Wireless Mesh Networks
• Progress, Justness and Fairness
• CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
• Analysing Mutual Exclusion using Process Algebra with Signals
• Ensuring Liveness Properties of Distributed Systems: Open Problems
• Ensuring Liveness Properties of Distributed Systems (A Research Agenda)
• Modelling and Analysis of AODV in UPPAAL
• Justness: A Completeness Criterion for Capturing Liveness Properties
• Formal Models of the OSPF Routing Protocol