Journal of the ACM (JACM)
A theory of clock synchronization (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal and efficient clock synchronization under drifting clocks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Gradient clock synchronization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: gradient clock synchronization in sensor networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Clock synchronization for wireless networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
An algorithm for clock synchronization with the gradient property in sensor networks
Journal of Parallel and Distributed Computing
Tight bounds for clock synchronization
Proceedings of the 28th ACM symposium on Principles of distributed computing
Gradient clock synchronization in dynamic networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Gradient clock synchronization in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Tight bounds for clock synchronization
Journal of the ACM (JACM)
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
Clock Synchronization: Open Problems in Theory and Practice
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
| Hi-index | 0.00 |
We study the gradient clock synchronization (GCS) problem, in which the worst-case clock skew between neighboring nodes has to be minimized. In particular, we consider oblivious clock synchronization algorithms which base their decision on how to adapt the clock solely on the most accurate timing information received from each neighbor. For several intuitive clock synchronization algorithms, which attempt to minimize the skew at all times, we show that the clock skew between neighboring nodes can be significantly larger than the proven lower bound of $\Omega(\frac{\log D}{\log\log D})$, where D denotes the diameter of the network. All of these natural algorithms belong to the class of oblivious clock synchronization algorithms. Additionally, we present an oblivious algorithm with a worst-case skew of $O(d + \sqrt{D})$ between any two nodes at distance d.