Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Fehnker, A., Van Glabbeek, R., Höfner, P., McIver, A., Portmann, M., & Tan, W. L. (2012). A process algebra for wireless mesh networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7211 LNCS, pp. 295–315). https://doi.org/10.1007/978-3-642-28869-2_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
