Secure and self-stabilizing clock synchronization in sensor networks

article
In sensor networks, correct clocks have arbitrary starting offsets and nondeterministic
fluctuating skews. We consider an adversary that aims at tampering with the clock
synchronization by intercepting messages, replaying intercepted messages (after the
adversary’s choice of delay), and capturing nodes (i.e., revealing their secret keys and
impersonating them). We present an efficient clock sampling algorithm which tolerates
attacks by this adversary, collisions, a bounded amount of losses due to ambient noise,
and a bounded number of captured nodes that can jam, intercept, and send fake messages.
The algorithm is self-stabilizing, so if these bounds are temporarily violated, the system
can efficiently stabilize back to a correct state. Using this clock sampling algorithm, we
construct the first self-stabilizing algorithm for secure clock synchronization in sensor
networks that is resilient to the aforementioned adversarial attacks.
TNO Identifier
462389
Source
Theoretical Computer Science, 412(16 September), pp. 5631-5647.
Pages
5631-5647
Files
To receive the publication files, please send an e-mail request to TNO Repository.