Skip to main content

Formalising the optimised link state routing protocol


Ryan Barry, Rob van Glabbeek and Peter Hoefner



UNSW Sydney

Australian National University


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.

BibTeX Entry

    author           = {Barry, Ryan and van Glabbeek, Rob and Hoefner, Peter},
    doi              = {},
    editor           = {{Fehnker, Ansgar; Garavel, Hubert}},
    month            = apr,
    date             = {2020-4-26},
    year             = {2020},
    keywords         = {wireless mesh networks; mobile ad-hoc networks; routing protocols; {OLSR}; process algebra;
    title            = {Formalising the Optimised Link State Routing Protocol},
    series           = {EPTCS},
    address          = {Dublin, Ireland},
    pages            = {40-71},
    volume           = {316},
    booktitle        = {4th Workshop on Models for Formal Analysis of Real Systems (MARS 2020)},
    paperurl         = {},
    publisher        = {Open Publishing Association}