A Timed Process Algebra for Wireless Networks with an Application in Routing (extended abstract)

Select |




Print


Bres, Emile; van Glabbeek, Robert; Höfner, Peter

Bres, Emile; van Glabbeek, Robert; Höfner, Peter


2016-04-02


Conference Material


European Symposium on Programming


Eindhoven, The Netherlands


95-122


27


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.


Springer


NICTA


https://doi.org/10.1007/978-3-662-49498-1_5


http://www.etaps.org/index.php/2016/esop/


© 2016


English


nicta:9051


Bres, Emile; van Glabbeek, Robert; Höfner, Peter. A Timed Process Algebra for Wireless Networks with an Application in Routing (extended abstract). In: P. Thiemann Editor, editor/s. European Symposium on Programming; Eindhoven, The Netherlands. Springer; 2016-04-02. 95-122. https://doi.org/10.1007/978-3-662-49498-1_5



Loading citation data...

Citation counts
(Requires subscription to view)