Discrete Mathematics - Topics on domination
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Wireless Communications
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
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
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Experimental study of concurrent transmission in wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Worst-case lifetime computation of a wireless sensor network by model-checking
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Model-based validation of QoS properties of biomedical sensor networks
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Real-Time Wireless Sensor Network for Landslide Detection
SENSORCOMM '09 Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications
Stochastic Games for Verification of Probabilistic Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Formal modeling and analysis of wireless sensor network algorithms in real-time maude
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Quality-Driven Volcanic Earthquake Detection Using Wireless Sensor Networks
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Toward probabilistic real-time calculus
ACM SIGBED Review
f-MAC: a deterministic media access control protocol without time synchronization
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Proceeings of the 2nd International Workshop on Worst-Case Traversal Time
| Hi-index | 0.00 |
Many critical applications which rely on Wireless Sensor Networks (WSNs) are proposed. Forest fire detection, landslide detection and intrusion detection are some examples. Critical applications require correct behavior, reliability, and the respect of time constraints. Otherwise, if they fail, consequences on human life and the environment could be catastrophic. For this reason, the WSN protocols used in these applications must be formally verified. Unfortunately the radio link is unreliable, it is thus difficult to give hard guarantees on the temporal behavior of the protocols (on wired systems the link error probability is very low [7], so they are considered reliable). Indeed, a message may experience a very high number of retransmissions. The temporal guarantee has thus to be given with a probability that it is achieved. This probability must meet the requirements of the application. Network protocols have been successfully verified on a given network topology without taking into account unreliable links. Nevertheless, the probabilistic nature of radio links may change the topology (links which appear and disappear). Thus instead of a single topology we have a set of possible topologies, each topology having a probability to exist. In this paper, we propose a method that produces the set of topologies, checks the property on every topology, and gives the probability that the property is verified. This technique is independent from the verification technique, i.e. each topology can be verified using any formal method which can give a "yes" or "no" answer to the question: "Does the model of the protocol respect the property?". In this paper we apply this method on f-MAC [23] protocol. F-MAC is a real-time medium access protocol for WSNs. We use UPPAAL model checker [10] as verification tool. We perform simulations to observe the difference between average and worst case behaviors.