Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
IEEE/ACM Transactions on Networking (TON)
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
A probabilistic energy-aware model for mobile ad-hoc networks
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A methodology based on formal methods for predicting the impact of dynamic power management
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
We present a framework for modelling ad-hoc Wireless Sensor Networks (WSNs) and studying both their connectivity properties and their performances in terms of energy consumption, throughput and other relevant indices. Our framework is based on a probabilistic process calculus where system executions are driven by Markovian probabilistic schedulers, allowing us to translate process terms into discrete time Markov chains (DTMCs) and use the probabilistic model checker PRISM to automatically evaluate/estimate the connectivity properties and the energy costs of the networks. To the best of our knowledge, this is the first work that proposes a unique framework for studying qualitative (e.g., by proving the equivalence of components or the correctness of a behaviour) and quantitative aspects of WSNs using a tool that allows both exact and approximate (via Monte Carlo simulation) analyses. We demonstrate our framework at work by considering different communication strategies based on gossip routing protocols, for a typical topology and a mobility scenario.