Secure and Resilient Time Synchronization in Wireless Sensor Networks

Sun, Kun; Ning, Peng; Wang, Cliff

doi:10.1007/978-0-387-46276-9_15

Cited by 58 publications

(92 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existing implementations of secure clock synchronization protocols [22,21,9,8,15,10,19] are not self-stabilizing. Thus, their specifications are not compatible with security requirements for autonomous systems.…”

Section: Discussionmentioning

confidence: 99%

“…In [22], the authors explain how to implement a secure clock synchronization protocol. Although the protocol is not self-stabilizing, we believe that some of their security primitives could be used in a self-stabilizing manner when implementing our self-stabilizing algorithm.…”

Section: Discussionmentioning

confidence: 99%

“…We denote the potential set of processors that processor p i ∈ P can directly communicate with (with whose communications, processor p i can interfere) by Security Primitives. The existing literature describes many elements of the secure implementation of the broadcast primitives LBcast and LBrecv using symmetric key encryption and message authentication (e.g., [18,22]). We assume that neighboring processors store predefined pairwise secret keys.…”

Section: System Settingsmentioning

confidence: 99%

“…We assume that all timestamps have T possible states. We assume the existence of an efficient algorithm for timestamping the message in transfer (see [22]). …”

Section: System Settingsmentioning

confidence: 99%

“…We assume that the adversary cannot break existing cryptographic primitives for sensor networks by eavesdropping (e.g., [18,22]). However, we assume that the adversary can capture nodes, reveal their entire state (including private variables), stop their execution, and impersonate them.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Secure and Self-stabilizing Clock Synchronization in Sensor Networks

Hoepman

Larsson

Schiller

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 the first self-stabilizing algorithm for secure clock synchronization in sensor networks that is resilient to such an adversary's attacks. Our algorithm tolerates random media noise, guarantees with high probability efficient communication overheads, and facilitates a variety of masking techniques against pulse-delay attacks in the presence of captured nodes.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: System Settingsmentioning

confidence: 99%

“…We assume that all timestamps have T possible states. We assume the existence of an efficient algorithm for timestamping the message in transfer (see [22]). …”

Section: System Settingsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Secure and Self-stabilizing Clock Synchronization in Sensor Networks

Hoepman

Larsson

Schiller

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Secured flooding time synchronization protocol with moderator

Teng

Yang

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARYThis work aims to address the security vulnerability of the Flooding Time Synchronization Protocol (FTSP), which is currently one of the most popular approaches for time synchronization in wireless sensor networks. FTSP has advanced features, such as implicitly dynamic topology and high time accuracy, but still has unresolved security issues. In order to defend against attacks from malicious nodes, we propose several technologies to reinforce the structure of FTSP. First, a reference node selecting mechanism is proposed to reduce the effect of multiple reference nodes, and four filters are proposed to defend against seqNum attack, global time attack and node replication attack. Experiment results show that the proposed sequence number blacklist filter and the global time blacklist filter are effective in defending against the aforementioned attacks. Second, a new root selection mechanism is proposed to secure the process of updating the root node. Combining the root selection mechanism with the global time black list filter, the proposed mechanisms successfully defend against traitor attacks on FTSP in our experiment. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Behavior of clock‐sampling mutual network synchronization in wireless sensor networks: convergence and security

McKnight-MacNeil¹,

Rentel²,

Kunz³

2009

Wireless Communications

View full text Add to dashboard Cite

Clock synchronization is an important component of wireless sensor networks (WSNs) both for co-ordination of node communications and for time stamping sensor data. The previously presented clock sampling mutual network synchronization (CS-MNS) algorithm is simple, has low communication and processing overhead, and allows fully decentralized operation. We present some simulation results that indicate the potential of CS-MNS to achieve high clock synchronization accuracy in mobile multi-hop wireless networks. Past work has shown clock convergence under specific conditions in single-hop networks. We show analytically that in the absence of offset errors, the network clocks converge. In the presence of offset errors, we present conditions on the degree of clock asynchrony under which the network clock rates show convergent behavior. The analysis is applicable as long as the network topology is connected and, thus, is of interest in both single-hop and multi-hop environments. As a side result, we also show how a network designer can use these conditions to add a bias term to the CS-MNS algorithm and, thus, improve the start-up dynamics of the algorithm. Furthermore, we discuss the algorithm from a security standpoint. Finally, we propose a method for adding external reference synchronization that is compatible with our security discussion. protocols [1], power management, and localization techniques among others. The IEEE 802.11 standard [2], for instance, utilizes network synchronization for power management and frequency hopping, whereas the IEEE 802.16 and the IEEE 802.15 [3] standards depend on network synchronization for their timeslotted medium access control (MAC) protocols. In

show abstract

Secure and Resilient Time Synchronization in Wireless Sensor Networks

Cited by 58 publications

References 47 publications

Secure and Self-stabilizing Clock Synchronization in Sensor Networks

Secure and Self-stabilizing Clock Synchronization in Sensor Networks

Secured flooding time synchronization protocol with moderator

Behavior of clock‐sampling mutual network synchronization in wireless sensor networks: convergence and security

Contact Info

Product

Resources

About