A process algebraic framework for estimating the energy consumption in ad-hoc wireless sensor networks

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.

[1]  Sabina Rossi,et al.  A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks , 2011, ASMTA.

[2]  Michele Zorzi,et al.  Error Control and Energy Consumption in Communications for Nomadic Computing , 1997, IEEE Trans. Computers.

[3]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[4]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[5]  Alessandro Aldini,et al.  A Methodology Based on Formal Methods for Predicting the Impact of Dynamic Power Management , 2005, SFM.

[6]  A. Dimakis,et al.  Geographic gossip: efficient aggregation for sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[7]  Indranil Gupta,et al.  Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[8]  Jean Goubault-Larrecq,et al.  A Probabilistic Applied Pi-Calculus , 2007, APLAS.

[9]  Gang Zhou,et al.  MMSN: Multi-Frequency Media Access Control for Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[11]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[12]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[13]  Michele Zorzi,et al.  Error Control and Energy Consumption in Wireless Communications Channels , 1997 .

[14]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[15]  Massimo Merro,et al.  An Observational Theory for Mobile Ad Hoc Networks (full version) , 2009, Inf. Comput..

[16]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[17]  N. V. S. N. Sarma,et al.  Maximizing Network Lifetime through Varying Transmission Radii with Energy Efficient Cluster Routing Algorithm in Wireless Sensor Networks , 2012 .

[18]  Lucia Gallina Formal models for qualitative and quantitative analysis of mobile ad hoc and sensor networks , 2013 .

[19]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[20]  Massimo Merro,et al.  An Observational Theory for Mobile Ad Hoc Networks , 2007, MFPS.