2026-07-20T11:15:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6676 2024-03-06T10:36:52Z ddc:004 open_access

Non Trivial Computations in Anonymous Dynamic Networks Di Luna, Giuseppe Baldoni, Roberto Distributed System Anonymous Networks Dynamic Networks In this paper we consider a static set of anonymous processes, i.e., they do not have distinguished IDs, that communicate with neighbors using a local broadcast primitive. The communication graph changes at each computational round with the restriction of being always connected, i.e., the network topology guarantees 1-interval connectivity. In such setting non trivial computations, i.e., answering to a predicate like "there exists at least one process with initial input a?", are impossible. In a recent work, it has been conjectured that the impossibility holds even if a distinguished leader process is available within the computation. In this paper we prove that the conjecture is false. We show this result by implementing a deterministic leader-based terminating counting algorithm. In order to build our counting algorithm we first develop a counting technique that is time optimal on a family of dynamic graphs where each process has a fixed distance h from the leader and such distance does not change along rounds. Using this technique we build an algorithm that counts in anonymous 1-interval connected networks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Giuseppe Di Luna and Roberto Baldoni 2016 Is Part Of LIPIcs, Volume 46, 19th International Conference on Principles of Distributed Systems (OPODIS 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2015.33 urn:nbn:de:0030-drops-66761 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2015.33 eng https://creativecommons.org/licenses/by/3.0/legalcode