A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks

Abstract

This paper surveys how formal verification can be used to prove the correctness of ad hoc routing protocols, which are fundamental infrastructure of wireless sensor networks. The existing techniques fall into two classes: verification on small-scale networks and verification on unbounded networks. The former one is always fully automatic and easy to use, thanks to the limited state space generated in verification. However, it cannot prove the correctness over all cases. The latter one can provide a complete proof based on abstractions of unbounded network. However, it usually needs user intervention and expertise in verification. The two kinds of technique are illustrated by verifications against some key properties such as stability, loop-freedom and deadlock-freedom. To conclude, they can be used to find faults and prove correctness, respectively. We believe that they can together aid the development of correct ad hoc routing protocols and their reliable implementations.

The Power of Synchronisation: Formal Analysis of Power Consumption in Networks of Pulse-Coupled Oscillators

“…While formal methods, in particular model checking, have been successfully used to model and analyse protocols for wireless sensor systems, the number of possible configurations that needs to be considered for larger WSNs impacts their feasibility. Chen et al reviewed how different formal methods may be used to investigate ad-hoc routing protocols [19], suggesting that model checking is suitable for small networks, while analytical methods are necessary for larger networks. Yue and Katoen [21] used probabilistic model checking to optimise the energy consumption of a leader election protocol in networks of up to nine nodes.…”

Applying Formal Methods to Networking: Theory, Techniques, and Applications

“…Various works have been proposed for protocol verification including rigorous specification and conformance testing techniques for network protocols [212], rigorous treatment of the TCP protocol [165] [196], verification of ad-hoc routing protocols for wireless sensor networks: [213]. There have been a few survey papers written focusing on communication protocols [214] [7], including a FSM-based protocol verification survey [211] and a survey documenting experience with protocol description [5].…”

Heuristic strategies for assessing wireless sensor network resiliency: an event-based formal approach

“…Chen et al (2013) provide an extensive review of automated formal verification techniques of ad hoc routing protocols for WSN; Katelman et al (2008) propose a formallybased system redesign methodology used to redesign a version of the LMST topology protocol that ensures network connectivity under realistic deployment conditions. Elleuch et al (2011) apply a probabilistic framework to formally reason about the expected values of coverage intensity in a WSN.…”