Secure and self-stabilizing clock synchronization in sensor networks

  • Authors:

  • Jaap-Henk Hoepman;Andreas Larsson;Elad M. Schiller;Philippas Tsigas

  • Affiliations:

  • TNO ICT, P.O. Box 1416, 9701 BK Groningen, The Netherlands and Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands;Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, Rännvägen 6B SE-412 96 Göteborg, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, Rännvägen 6B SE-412 96 Göteborg, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, Rännvägen 6B SE-412 96 Göteborg, Sweden

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 5.23

Visualization

Abstract

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.