A Process Algebra for Wireless Mesh Networks

Select |




Print


Fehnker, Ansgar; van Glabbeek, Robert; Höfner, Peter; McIver, Annabelle; Portmann, Marius; Tan, Wee Lum

Fehnker, Ansgar; van Glabbeek, Robert; Höfner, Peter; McIver, Annabelle; Portmann, Marius; Tan, Wee Lum


2012-03-26


Conference Material


22nd European Symposium on Programming (ESOP 2012)


Tallinn, Estonia


295-315


We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.


Springer


process algebra; wireless mesh networks; Ad-hoc On-Demand Distance Vector (AODV); routing protocols; loop freedom


http://www.etaps.org/2012/esop


0302-9743


nicta:4801


Fehnker, Ansgar; van Glabbeek, Robert; Höfner, Peter; McIver, Annabelle; Portmann, Marius; Tan, Wee Lum. A Process Algebra for Wireless Mesh Networks. In: Helmut Seidl Editor, editor/s. 22nd European Symposium on Programming (ESOP 2012); Tallinn, Estonia. Springer; 2012-03-26. 295-315.



Loading citation data...

Citation counts
(Requires subscription to view)