Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
CMC: a pragmatic approach to model checking real code
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
IEEE 802.11S: the WLAN mesh standard
IEEE Wireless Communications
Routing primitives for wireless mesh networks: design, analysis and experiments
INFOCOM'10 Proceedings of the 29th conference on Information communications
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A process algebra for wireless mesh networks
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Sequence numbers do not guarantee loop freedom: AODV can yield routing loops
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Topology-Based mobility models for wireless networks
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
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 network topologies up to 5 nodes. We were able to automatically locate problematic and undesirable behaviours. This is in particular useful to discover protocol limitations and to develop improved variants. This use of model checking as a diagnostic tool complements other formal-methods-based protocol modelling and verification techniques, such as process algebra.