Skip to main content


A timed process algebra for wireless networks with an application in routing (extended abstract)


Emile Bres, Rob van Glabbeek and Peter Hoefner

Ecole Polytechnique




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 data structures, which are essential features for the modelling of network protocols. In this framework we model and analyse the Ad hoc On-Demand Distance Vector routing protocol, and show that, contrary to claims in the literature, it fails to be loop free. We also present boundary conditions for a fix ensuring that the resulting protocol is indeed loop free.

BibTeX Entry

    publisher        = {Springer},
    doi              = {10.1007/978-3-662-49498-1_5},
    author           = {Bres, Emile and van Glabbeek, Robert and Höfner, Peter},
    month            = apr,
    editor           = {{P. Thiemann}},
    year             = {2016},
    title            = {A Timed Process Algebra for Wireless Networks with an Application in Routing (extended abstract)},
    booktitle        = {European Symposium on Programming},
    pages            = {95-122},
    address          = {Eindhoven, The Netherlands}


Served by Apache on Linux on seL4.
Served by Apache on Linux on seL4.