Modelling Clock Synchronization in the Chess gMAC WSN Protocol
Mathijs Schuts, Feng Zhu, Faranak Heidarian and 1 more
Electronic Proceedings in Theoretical Computer Science · 2009
doi:10.4204/eptcs.13.4 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
We present a detailled timed automata model of the clock synchronization algorithm that is currently being used in a wireless sensor network (WSN) that has been developed by the Dutch company Chess. Using the Uppaal model checker, we establish that in certain cases a static, fully synchronized network may eventually become unsynchronized if the current algorithm is used, even in a setting with infinitesimal clock drifts.
Abstract licence: CC BY-NC-ND
References16
16 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.