Automated Analysis of AODV Using UPPAAL

@inproceedings{Fehnker2012AutomatedAO,
  title={Automated Analysis of AODV Using UPPAAL},
  author={A. Fehnker and R. V. Glabbeek and P. H{\"o}fner and Annabelle McIver and M. Portmann and W. Tan},
  booktitle={TACAS},
  year={2012}
}
This paper describes an automated, formal and rigorous analysis of the Ad hoc On-Demand Distance Vector (AODV) routing protocol, a popular protocol used in wireless mesh networks. We give a brief overview of a model of AODV implemented in the UPPAAL model checker. It is derived from a process-algebraic model which reflects precisely the intention of AODV and accurately captures the protocol specification. Furthermore, we describe experiments carried out to explore AODV's behaviour in all… Expand
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 tailoredExpand
Formal Modelling and Analysis of AODV
TLDR
A case study of routing protocol in wireless networks, which formalizes the route discovery process of AODV routing protocol using Object-Z and shows the proof of loop freedom property for established routes based on the specification. Expand
Towards a rigorous analysis of AODVv2 (DYMO)
TLDR
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
TLDR
A formal executable and parameterized modeling framework for MANETs in Real-Time Maude that integrates several mobility models and wireless communication is presented. Expand
A Framework for Mobile Ad hoc Networks in Real-Time Maude
TLDR
A formal executable and parameterized modeling framework for MANETs in Real-Time Maude that integrates several mobility models and wireless communication and the Ad hoc On-Demand Distance Vector routing protocol is presented. Expand
Formal Analysis of Proactive, Distributed Routing
TLDR
This paper focuses on modelling and analysing the Optimised Link State Routing protocol, a distributed, proactive routing protocol for Wireless Mesh Networks (WMNs), and uses the model checker Uppaal for analysing safety properties of OLSR. Expand
Statistical Model Checking of Wireless Mesh Routing Protocols
TLDR
This paper presents a quantitative analysis of two well-known routing protocols for wireless mesh networks, namely AODV and DYMO, and shows that this technology is capable of analysing networks of up to 100 nodes. Expand
Model checking mobile ad hoc networks
TLDR
A model checking algorithm is presented to verify MANETs that allow arbitrary mobility, under the assumption of reliable communication, and is applied to analyze a leader election protocol. Expand
Model Checking Techniques for State Space Reduction in MANET Protocol Verification
TLDR
A modeling technique to mitigate the state explosion problem of MANET protocols, using the AODV protocol as a running example, and shows that using the proposed technique significantly reduced the time and memory used in model checking. Expand
State space reduction techniques for model checking of MANET protocols
TLDR
The results of experiments using the SPIN model checker show that using the proposed technique significantly reduced the time and memory usage compared to standard full state exploration and allowed us to model check the protocol with up to five nodes. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 19 REFERENCES
A Timing Analysis of AODV
TLDR
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
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
TLDR
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 is presented. Expand
Formal verification of ad-hoc routing protocols using SPIN model checker
  • F. de Renesse, A. Aghvami
  • Computer Science
  • Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference (IEEE Cat. No.04CH37521)
  • 2004
TLDR
A new technique to formally verify ad-hoc network routing protocols by the use of a well-known model-checker: SPIN is presented. Expand
Automatized Verification of Ad Hoc Routing Protocols
TLDR
Two model checking tools, SPIN and UPPAAL, are evaluated using the verification of the Lightweight Underlay Network Ad hoc Routing protocol (LUNAR) as a case study, identifying important modeling considerations and the types of ad hoc protocol properties that can realistically be verified. Expand
Formal verification of standards for distance vector routing protocols
TLDR
This work shows how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols, and develops verification techniques suited to routing protocols generally. Expand
Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks
TLDR
Modelling and verification of a medium access control protocol for wireless sensor networks, the LMAC protocol, to systematically investigate all possible connected topologies consisting of four and of five nodes increased the confidence in the adequacy of the protocol. Expand
Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments
TLDR
This paper uses extensive measurements on a large operational wireless mesh network to show that with node-pair discovery primitives, inferior route selections occur regularly and cause long-term throughput degradations for network users. Expand
Formal Techniques for Networked and Distributed Systems – FORTE 2004
TLDR
Formal Verification of a Practical Lock-Free Queue Algorithm for Web Applications Modeled by Communicating Automata and Conditions for Resolving Observability Problems in Distributed Testing. Expand
Formal Methods for the Design of Real-Time Systems
TLDR
A survey of the theoretical results concerning decision problems of reachability, language inclusion and language equivalence for timed automata and its variants, with some new proofs and comparisons is provided. Expand
A Process Algebra for Wireless Mesh Networks
TLDR
This work proposes a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures and proves crucial properties such as loop freedom and packet delivery. Expand
...
1
2
...