A Process Algebra for Wireless Mesh Networks
classification
💻 cs.LO
cs.NI
keywords
algebrameshnetworksprocesswirelessad-hocaodvbroadcast
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.