Skip to Main content Skip to Navigation
New interface

Synchronization Modulo k in Dynamic Networks

Abstract : We define the mod k-synchronization problem as a weakening of the Firing Squad problem, where all nodes fire not at the same round, but at rounds that are all equal modulo k. We propose an algorithm that achieves mod k-synchronization in any dynamic network where there exist – possibly several – fixed spanning stars within each period of Delta consecutive rounds. In other words, we require that there always exists a temporal path of length at most Delta between some fixed node gamma and every other node. As opposed to the perfect synchronization achieved in the Firing Squad problem, mod k-synchronization thus does not require any strong connectivity property in the network. In our algorithm, all the nodes "know'' Delta, but they ignore what nodes are the centers of the spanning stars. We also prove that if the bound Delta for guaranteeing fixed spanning stars exists but is unknown to the agents, then mod k-synchronization is impossible.All nodes in our algorithm fire in less that 6kn + 4k rounds after all nodes become active, but unfortunately use unbounded counters. We then propose a refinement of this algorithm so that it becomes finite state while maintaining the same time complexity. The correctness of our first algorithm has been formally established in the proof assistant Isabelle.
Document type :
Complete list of metadata
Contributor : Bernadette CHARRON-BOST Connect in order to contact the contributor
Submitted on : Monday, November 28, 2022 - 1:56:25 PM
Last modification on : Monday, November 28, 2022 - 3:56:26 PM


Files produced by the author(s)



Louis Penet de Monterno, Bernadette Charron-Bost, Stephan Merz. Synchronization Modulo k in Dynamic Networks. 13046, pp.425-439, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-91081-5_28⟩. ⟨hal-03451085⟩



Record views


Files downloads