Scalable Modeling and Performance Evaluation of Wireless Sensor Networks

A notable features of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state of the entire system as a cross-product of the states of individual nodes results in the well-known state explosion problem. Instead, we represent the system state by the probability distribution on the state of each node. In other words, the system state represents the probability that a randomly picked node is in a certain state. Although such statistical abstraction of the global state loses some information, it is nevertheless useful in determining many performance metrics of systems that exhibit Markov behavior. We have previously developed a method for specifying the performance metrics of such systems in a probabilistic temporal logic called iLTL and for evaluating the behavior through a novel method for model checking iLTL properties. In this paper, we describe a method for estimating the probabilities in a Discrete Time Markov Chain (DTMC) model of a large-scale system. We also provide a statistical test so that we can reject estimated DTMCs if the actual system does not have Markov behavior. We describe results of experiments applying our method toWSNs in an experimental test-bed, as well as using simulations. The results of our experiments suggest that our model estimation and model checking method provides a systematic, precise and easy way of evaluating performance metrics of some large-scale WSNs.

[1]  S. Goddard,et al.  Proceedings of the twelfth IEEE Real-Time and Embedded Technology and Applications Symposium, 4-7, April 2006, San Jose, California , 2006 .

[2]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[3]  Gyula Simon,et al.  Shooter localization in urban terrain , 2004, Computer.

[4]  Gul A. Agha,et al.  Linear Inequality LTL (iLTL): A Model Checker for Discrete Time Markov Chains , 2004, ICFEM.

[5]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[6]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[7]  Adnan Aziz,et al.  It Usually Works: The Temporal Logic of Stochastic Systems , 1995, CAV.

[8]  Deborah Estrin,et al.  A wireless sensor network For structural monitoring , 2004, SenSys '04.

[9]  John Anderson,et al.  An analysis of a large scale habitat monitoring application , 2004, SenSys '04.

[10]  Gul Agha,et al.  Cooperative tracking with binary-detection sensor networks. , 2003 .

[11]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[12]  Marta Z. Kwiatkowska,et al.  PRISM 2.0: a tool for probabilistic model checking , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..

[13]  Bruno Sericola,et al.  Performability Analysis Using Semi-Markov Reard Processes , 1990, IEEE Trans. Computers.

[14]  Zack J. Butler,et al.  Tracking a moving object with a binary sensor network , 2003, SenSys '03.

[15]  Christel Baier,et al.  Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.

[16]  Carolyn L. Talcott,et al.  A foundation for actor computation , 1997, Journal of Functional Programming.