Skip to main content

Formalising the optimised link state routing protocol

Authors

Ryan Barry, Rob van Glabbeek and Peter Hoefner

DATA61

UNSW

UNSW Sydney

Australian National University

Abstract

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

  @inproceedings{Barry_GH_20,
    author           = {Barry, Ryan and van Glabbeek, Rob and Hoefner, Peter},
    doi              = {https://doi.org/10.4204/EPTCS.316.3},
    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;
                        {T}-{AWN}},
    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         = {https://ts.data61.csiro.au/publications/csiro_full_text//Barry_GH_20.pdf},
    publisher        = {Open Publishing Association}
  }

Download

Served by Apache on Linux on seL4.