Stabilizing Consensus in Mobile Networks

Full textClick to download.
Citationin Proc. of The International Conference on Distributed Computing in Sensor Systems (DCOSS) 2006
AuthorsDana Angluin
Michael J. Fischer
Hong Jiang


Inspired by the characteristics of biologically-motivated systems consisting of autonomous agents, we define the notion of stabilizing consensus in fully decentralized and highly dynamic ad hoc systems. Stabilizing consensus requires non-faulty nodes to eventually agree on one of their inputs, but individual nodes do not necessarily know when agreement is reached. First we show that, similar to the original consensus problem in the synchronous model, there exist deterministic solutions to the stabilizing consensus problem tolerating crash faults. Similarly, stabilizing consensus can also be solved deterministically in presence of Byzantine faults with the assumption that $n > 3f$ where $n$ is the number of nodes and $f$ is the number of faulty nodes. Our main result is a Byzantine consensus protocol in a model in which the input to each node can change finitely many times during execution and eventually stabilizes. Finally we present an impossibility result for stabilizing consensus in systems of identical nodes.

Back to publications
Back to previous page