Non Trivial Computations in Anonymous Dynamic Networks

  title={Non Trivial Computations in Anonymous Dynamic Networks},
  author={Giuseppe Antonio Di Luna and Roberto Baldoni},
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…