Verisim: Formal analysis of network simulations
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Verisim: Formal Analysis of Network Simulations
IEEE Transactions on Software Engineering
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
Counter-Example Based Predicate Discovery in Predicate Abstraction
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Scaling up Uppaal Automatic Verification of Real-Time Systems Using Compositionality and Abstraction
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
The Power of Reachability Testing for Timed Automata
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Compositional and symbolic model-checking of real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
AODV Routing Protocol Implementation Design
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
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
ACM Computing Surveys (CSUR)
Design and verification of systems with exogenous coordination using Vereofy
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Formal security analysis of Ariadne secure routing protocol using model checking
International Journal of Ad Hoc and Ubiquitous Computing
Ad hoc routing protocol verification through broadcast abstraction
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Automated analysis of AODV using UPPAAL
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A state-based model of sensor protocols
Theoretical Computer Science
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
| Hi-index | 0.00 |
Mobile ad hoc networks (MANETs) are wireless networks formed spontaneously. Communication in such networks typically involves multi-hop relays, and is subjected to dynamic topology changes and frequent link failures. This complex scenario demands robust routing protocol standards that ensure correct and timely delivery of messages. Recently, formal verification has been successful in detecting ambiguities in protocol standards. We consider the Ad hoc On Demand Distance Vector (AODV) protocol, a reactive protocol currently undergoing standardisation at the IETF (RFC3561). AODV performs route discovery whenever a route to the destination is needed, and retains routing information for a period of time specified by the standard. We apply 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. Our study of the recent versions of the standard (RFC3561-bis-01) has highlighted a dependency of the lifetime of routes on network size, which can be alleviated by allowing the route timeouts to adapt to network growth.