Modeling of Sensor Networks Using XRM

Wireless sensor networks are composed of small electronic devices that embed processors, sensors, batteries, memory and communication capabilities. One of the main goals in the design of such systems is the handling of the inherent complexity of the nodes, exacerbated by the huge number of nodes in the network. For these reasons, it becomes very difficult to model and verify such systems. In this paper, we investigate the main characteristics of sensor nodes, discuss the use of a language derived from Reactive Modules for their modeling, and propose a language (and a tool set) that facilitate the modeling of this kind of system.

[1]  Thomas Hérault,et al.  APMC 3.0: Approximate Verification of Discrete and Continuous Time Markov Chains , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

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

[3]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

[4]  Thomas Hérault,et al.  Approximate Probabilistic Model Checking , 2004, VMCAI.

[5]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[6]  Roy Friedman,et al.  Timed grid routing (TIGR) bites off energy , 2005, MobiHoc '05.

[7]  Thomas Hérault,et al.  Probabilistic verification of sensor networks , 2006, 2006 International Conference onResearch, Innovation and Vision for the Future.

[8]  Thomas A. Henzinger,et al.  Reactive Modules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[9]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[10]  N. S. Barnett,et al.  Private communication , 1969 .

[11]  Eelco Visser,et al.  Program Transformation with Stratego/XT: Rules, Strategies, Tools, and Systems in Stratego/XT 0.9 , 2003, Domain-Specific Program Generation.