Formalising the Optimised Link State Routing Protocol

  title={Formalising the Optimised Link State Routing Protocol},
  author={Ryan Barry and R. V. Glabbeek and P. H{\"o}fner},
Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise and verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2. 


Formal Analysis of Proactive, Distributed Routing
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
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
Modelling Link State Routing in Event-B
  • M. Kamali, L. Petre
  • Computer Science
  • 2016 21st International Conference on Engineering of Complex Computer Systems (ICECCS)
  • 2016
This paper presents a stepwise formal development of the Optimised Link State Routing protocol in Event-B, and model and prove functional properties of OLSR in an automated and interactive manner, at a highly general level. Expand
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol
The mechanization of an existing pen-and-paper proof of loop freedom of AODV in the interactive theorem prover Isabelle/HOL is described, which relies on a novel compositional approach for lifting invariants to networks of nodes. Expand
Modeling the optimized link-state routing protocol for verification
The application of formal methods to verify properties of the Optimized Link-State Routing protocol, an associated framework for topology enumeration, which automates the verification process over all network configurations, for an N-node network. Expand
A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)
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 dataExpand
Automated Analysis of AODV Using UPPAAL
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
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
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
Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
It is shown that the translation respects strong bisimilarity; hence all safety properties can be automatically checked using the toolset, and the sophisticated toolset of mCRL2 is now available for AWN-specifications. Expand
Mechanizing a Process Algebra for Network Protocols
This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties.Expand