Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
Continuous clock amortization need not affect the precision of a clock synchronization algorithm
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Fine-grained network time synchronization using reference broadcasts
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Brief announcement: gradient clock synchronization in sensor networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Gradient clock synchronization
Distributed Computing - Special issue: PODC 04
Oblivious gradient clock synchronization
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Clock synchronization for wireless networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Gradient Clock Synchronization Using Reference Broadcasts
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Analysis of a clock synchronization protocol for wireless sensor networks
Theoretical Computer Science
Average time synchronization in wireless sensor networks by pairwise messages
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We introduce a distributed algorithm for clock synchronization in sensor networks. Our algorithm assumes that nodes in the network only know their immediate neighborhoods and an upper bound on the network's diameter. Clock-synchronization messages are only sent as part of the communication-assumed to be reasonably frequent-that already takes place among nodes. The algorithm has the gradient property of [R. Fan, N. Lynch, Gradient clock synchronization, Distributed Computing 18 (2006) 255-266], achieving an O(1) worst-case skew between the logical clocks of neighbors. The algorithm's actions are such that no constant lower bound exists on the rate at which logical clocks progress in time, and for this reason the lower bound of [R. Fan, N. Lynch, Gradient clock synchronization, Distributed Computing 18 (2006) 255-266; L. Meier, L. Thiele, Brief announcement: Gradient clock synchronization in sensor networks, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005, p. 238] that forbids a constant clock skew between neighbors does not apply.