Title
A Timed Process Algebra for Wireless Networks with an Application in Routing
Abstract
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.
Year
DOI
Venue
2016
10.1007/978-3-662-49498-1_5
Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632
DocType
Volume
ISSN
Conference
9632
Proc. 25th European Symposium on Programming, ESOP'16, (Peter Thiemann, ed.), LNCS 9632, Springer, 2016, pp. 95-122
ISBN
Citations 
PageRank 
978-3-662-49497-4
1
0.35
References 
Authors
18
3
Name
Order
Citations
PageRank
Emile Bres110.35
Rob J. van Glabbeek21930134.34
Peter Höfner339127.80