Optimal gradient clock synchronization in dynamic networks

We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node, such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are better synchronized than distant nodes. This property is called gradient clock synchronization. Gradient clock synchronization has been widely studied in the static setting, where the network topology does not change. We show that the asymptotically optimal bounds obtained for the static case also apply to our highly dynamic setting: if two nodes remain at distance d from each other for sufficientl...

• Type: Conference
• Year: 2010
• Where: PODC
• Authors: Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rotem Oshman
• Keywords: Clock, Clock Synchronization, Distributed And Parallel Computing, Gradient Clock Synchronization, PODC 2010