Download Now Free registration required
This paper studies a clock synchronization protocol for the Chess WSN. First, the paper models the protocol as a network of timed automata and verifies various instances using the Uppaal model checker. Next, it presents a full parametric analysis of the protocol for the special case of cliques (networks with full connectivity), that is, the paper gives constraints on the parameters that are both necessary and sufficient for correctness. These results have been checked using the proof assistant Isabelle. Finally, the paper presents a negative result for the special case of line topologies: for any instantiation of the parameters, the protocol will eventually fail if the network grows.
- Format: PDF
- Size: 628.6 KB