Dustminer: troubleshooting interactive complexity bugs in sensor networks
Proceedings of the 6th ACM conference on Embedded network sensor systems
Theoretical Computer Science
Probabilistic Analysis of Wireless Systems Using Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Verifying Correctness of Wireless Sensor Network Applications Using Insense and Spin
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Diagnostic powertracing for sensor node failure analysis
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
KleeNet: discovering insidious interaction bugs in wireless sensor networks before deployment
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
ACM Computing Surveys (CSUR)
Lazy preemption to enable path-based analysis of interrupt-driven code
Proceedings of the 2nd Workshop on Software Engineering for Sensor Network Applications
Formal analysis of a scheduling algorithm for wireless sensor networks
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Hi-index | 0.00 |
We describe verification of S-MAC, a medium access control protocol designed for wireless sensor networks, by means of the PRISM model checker. The S-MAC protocol is built on top of the IEEE 802.11 standard for wireless {\itad hoc} networks and, as such, it uses the same randomised back off procedure as a means to avoid collision. In order to minimise energy consumption, in S-MAC, nodes are periodically put into a sleep state. Synchronisation of the sleeping schedules is necessary for the nodes to be able to communicate. Intuitively, energy saving obtained through a periodic sleep mechanism will be at the expense of performance. In previous work on S-MAC verification~\cite{yehees}, a combination of analytical techniques and simulation has been used to confirm the correctness of this intuition for a simplified (abstract) version of the protocol in which the initial schedules coordination phase is assumed correct. We show how we have used the PRISM model checker to verify the behaviour of S-MAC and compare it to that of IEEE 802.11.