Abstract
We introduce the distributed gradientclock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clocks with bounded drift. Nodes compute logical clock values based on their hardware clocks and message exchanges, and the goal is to synchronize the nodes' logical clocks as closely as possible, while satisfying certain validity conditions. The new feature of gradient clock synchronization GCS for short) is to require that the skew between any two nodesy' logical clocks be bounded by a nondecreasing function of the uncertainty in message delay (call this the distance) between the two nodes, and other network parameters. That is, we require nearby nodes to be closely synchronized, and allow faraway nodes to be more loosely synchronized. We contrast GCS with traditional clock synchronization, and discuss several practical motivations for GCS, mostly arising in sensor and ad-hoc networks. Our main result is that the worst case clock skew between two nodes at distance d or less from each other is Ω(d + \(\frac{{\rm log} D}{{\rm log} {\rm log} D})\), where D is the diameter of the network. This means that clock synchronization is not a localproperty, in the sense that the clock skew between two nodes depends not only on the distance between the nodes, but also on the size of the network. Our lower bound implies, for example, that the TDMA protocol with a fixed slot granularity will fail as the network grows, even if the maximum degree of each node stays constant.
Similar content being viewed by others
References
Biaz, S., Welch, J.L.: Closed form bounds for clock synchronization under simple uncertainty assumptions. Inf. Proc. Lett., 80(3), 151–157 (2001)
Elson, J., Girod, L., Estrin, D.: Fine-grained network time synchronization using reference broadcasts. SIGOPS Operating Syst. Rev., 36(SI), 147–163 (2002)
Halpern, J.Y., Megiddo, N., Munshi, A.A.: Optimal precision in the presence of uncertaint. J. Complexity 1(2), 170–196 (1985)
Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: Timed I/O automata: A mathematical framework for modeling and analyzing real-time systems. In: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)
Lamport, L., Melliar-Smith, M.P.: Synchronizing clocks in the presence of faults. J. ACM 32(1), 52–78 (1985)
Lloyd, E.: Broadcast scheduling for tdma in wireless multihop networks. In: Handbook of Wireless Networks and Mobile Computing, pp. 347–370 (2002)
Lundelius, J., Lynch, N.: An upper and lower bound for clock synchronization. Inf. Control 62, 190–204 (1984)
Meier, L., Thiele, L.: Gradient clock synchronization in sensor networks. Technical report, Computer Engineering and Networks Laboratory. Swiss Federal Institute of Technology Zurich (2005)
Ostrovsky, R., Patt-Shamir, B.: Optimal and efficient clock synchronization under drifting clocks. In: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 3–12. ACM Press (1999)
Patt-Shamir, B., Rajsbaum, S.: A theory of clock synchronization. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 810–819. ACM Press (1994)
Qi, H., Wang, X., Iyengar, S.S., Chakrabarty, K.: Multisensor data fusion in distributed sensor networks using mobile agents. In: Proceedings of the International Conference on Information Fusion, pp. 11–16 (2001)
Srikanth, T.K., Toueg, S.: Optimal clock synchronization. J. ACM 34(3), 626–645 (1987)
Welch, J.L., Lynch, N.: A new fault-tolerant algorithm for clock synchronization. Inf. Comput., 77(1), 1–36 (1988)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fan, R., Lynch, N. Gradient clock synchronization. Distrib. Comput. 18, 255–266 (2006). https://doi.org/10.1007/s00446-005-0135-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-005-0135-6