Cerone, Andrea and Hennessy, Matthew - Modelling Probabilistic Wireless Networks

lmcs:949 - Logical Methods in Computer Science, September 25, 2013, Volume 9, Issue 3
Modelling Probabilistic Wireless Networks

Authors: Cerone, Andrea and Hennessy, Matthew

We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication and probabilistic behaviour. We first focus on the problem of composing wireless networks, then we present a compositional theory based on a probabilistic generalisation of the well known may-testing and must-testing pre- orders. Also, we define an extensional semantics for our calculus, which will be used to define both simulation and deadlock simulation preorders for wireless networks. We prove that our simulation preorder is sound with respect to the may-testing preorder; similarly, the deadlock simulation pre- order is sound with respect to the must-testing preorder, for a large class of networks. We also provide a counterexample showing that completeness of the simulation preorder, with respect to the may testing one, does not hold. We conclude the paper with an application of our theory to probabilistic routing protocols.


Source : oai:arXiv.org:1309.4693
DOI : 10.2168/LMCS-9(3:26)2013
Volume: Volume 9, Issue 3
Published on: September 25, 2013
Submitted on: December 14, 2012
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 89 times.
This article's PDF has been downloaded 29 times.