Non Trivial Computations in Anonymous 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. 1998 ACM Subject Classification C.2.4 Distributed Systems

DOI: 10.4230/LIPIcs.OPODIS.2015.33

6 Figures and Tables

Cite this paper

@inproceedings{Luna2015NonTC, title={Non Trivial Computations in Anonymous Dynamic Networks}, author={Giuseppe Antonio Di Luna and Roberto Baldoni}, booktitle={OPODIS}, year={2015} }