Theoretical Computer Science
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
An algebraic framework for urgency
Information and Computation
Lifetime analysis of a sensor network with hybrid automata modelling
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Partial Order Reduction in Directed Model Checking
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Dual-mode real-time MAC protocol for wireless sensor networks: a validation/simulation approach
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Semantics and pragmatics of Real-Time Maude
Higher-Order and Symbolic Computation
Theoretical Computer Science
Proceeings of the 2nd International Workshop on Worst-Case Traversal Time
Formal verification of real-time wireless sensor networks protocols with realistic radio links
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each node, a crucial property of interest for the users is the minimal lifetime of the network. In practice, this value strongly depends both on the design choices performed for each network element (hardware architecture, communication protocols, etc.) and on the wholeexecution environment (physical environment, execution platform, network topology, etc.). We propose here an original approach to evaluate this minimal network lifetime based on model-checking techniques. It consists first in designing a timed model of the entire network behavior (taking into account its execution environment), and then to compute on the state space associated to this model the shortest execution sequences (from a temporal point of view) leading to some states considered as "terminal'' (from the network lifetime point of view).This approach is illustrated on a concrete example of a WSN application to compare the influence on the network lifetime of two classical routing algorithms.