Diffusive clock synchronization in highly dynamic networks

Matthias Függer (1) , Thomas Nowak (2) , Bernadette Charron-Bost (3)

1 Institute of Computer Engineering [Vienna]
2 DYOGENE - Dynamics of Geometric Networks
3 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

This paper studies the clock synchronization problem in highly dynamic networks. We show that diffusive synchronization algorithms are well adapted to environments in which the network topology may change unpredictably. In a diffusive algorithm, each node repeatedly (i) estimates the clock difference to its neighbors via broadcast of zero-bit messages, and (ii) updates its local clock according to a weighted average of the estimated differences. The system model allows for drifting local clocks, running at possibly different frequencies. We show that having a rooted spanning tree in the network at every time instance suffices to solve clock synchronization. We do not require any stability of the spanning tree, nor do we impose that the links of the spanning tree be known to the nodes. Explicit bounds on the convergence speed are obtained. In particular, our results settle an open question posed by Simeone and Spagnolini to reach clock synchronization in dynamic networks in the presence of nonzero clock drift. We also identify certain reasonable assumptions that allow for a significant higher convergence speed, e.g., bidirectional networks or random graph models.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Matthias Függer, Thomas Nowak, Bernadette Charron-Bost. Diffusive clock synchronization in highly dynamic networks. 49th Annual Conference on Information Systems and Sciences (CISS 2015), Mar 2015, Baltimore, United States. ⟨10.1109/CISS.2015.7086841⟩. ⟨hal-01231513⟩