A Process Algebra for Wireless Mesh Networks

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 pack...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2015-12
Main Authors: Fehnker, Ansgar, Rob van Glabbeek, Höfner, Peter, McIver, Annabelle, Portmann, Marius, Wee Lum Tan
Format: Article
Language:English
Subjects:
Data structures
Finite element method
Routing (telecommunications)
Wireless networks
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1512.07319