Alexander Gogolev
Christian Bettstetter
Skip Abstract Section
Abstract
This article evaluates convergence rates of binary majority consensus algorithms in networks with different types of disturbances and studies the potential capacity of randomization to foster convergence. Simulation results show that (a) additive noise, topology randomness, and stochastic message loss may improve the convergence rate; (b) presence of faulty nodes degrades the convergence rate; and (c) explicit randomization of consensus algorithms can be exploited to improve the convergence rate. Watts-Strogatz and Waxman graphs are used as underlying network topologies. A consensus algorithm is proposed that exchanges state information with dynamically randomly selected neighbors and, through this randomization, achieves almost sure convergence in some scenarios.
- Marcos K. Aguilera and Sam Toueg. 2012. The correctness proof of Ben-Ors randomized consensus algorithm. Distributed Computing 25, 5, 371--381.Google Scholar
Cross Ref
- Mehdi Alighanbari and Jonathan P. How. 2006. An unbiased Kalman consensus algorithm. In Proceedings of American Control Conference. 3519--3524.Google Scholar
- David Andre, Forrest H. Bennett III, and John R. Koza. 1996. Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem. In Proceedings of the Annual Conference on Genetic Programming. 3--11. Google ScholarDigital Library
- James Aspnes. 2000. Fast deterministic consensus in a noisy environment. In Proceedings of the ACM Symposium on Principles of Distributed Computing. 299--308. Google ScholarDigital Library
- James Aspnes. 2002. Fast deterministic consensus in a noisy environment. Journal of Algorithms 45, 1, 16--39. Google ScholarDigital Library
- James Aspnes. 2003. Randomized protocols for asynchronous consensus. Distributed Computing 16, 2--3, 165--175. Google ScholarDigital Library
- Albert-Laszlo Barabási and Albert Reka. 1999. Emergence of scaling in random networks. Science 286, 5439, 509--512.Google Scholar
- Michael Ben-Or. 1983. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the ACM Symposium on Principles of Distributed Computing. 27--30. Google ScholarDigital Library
- Gabriel Bracha and Ophir Rachman. 1992. Randomized consensus in expected O(n2log n) operations. In Distributed Algorithms. Lecture Notes in Computer Science, Vol. 579. Springer, 143--150. Google ScholarDigital Library
- Gabriel Bracha and Sam Toueg. 1985. Asynchronous consensus and broadcast protocols. Journal of the ACM 32, 4, 824--840. Google ScholarDigital Library
- Janna Burman, Ted Herman, Shay Kutten, and Boaz Patt-Shamir. 2006. Asynchronous and fully self-stabilizing time-adaptive majority consensus. In Principles of Distributed Systems. Lecture Notes in Computer Science, Vol. 3974. Springer, 146--160. Google ScholarDigital Library
- Ming Cao, Andrew Stewart, and Naomi E. Leonard. 2008. Integrating human and robot decision-making dynamics with feedback: Models and convergence analysis. In 47th IEEE Conference on Decision and Control. 1127--1132.Google Scholar
- Ming Cao, Andrew Stewart, and Naomi E. Leonard. 2010. Convergence in human decision-making dynamics. Systems and Control Letters 59, 2, 87--97.Google ScholarCross Ref
- Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. 1996. The weakest failure detector for solving consensus. Journal of the ACM 43, 4, 685--722. Google ScholarDigital Library
- Tushar Deepak Chandra and Sam Toueg. 1996. Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43, 2, 225--267. Google ScholarDigital Library
- Rajarshi Das, James P. Crutchfield, Melanie Mitchell, and James E. Hanson. 1995. Evolving globally synchronized cellular automata. In Proceedings of the International Conference on Genetic Algorithms. 336--343. Google ScholarDigital Library
- Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. 1987. On the minimal synchronism needed for distributed consensus. Journal of the ACM 34, 1, 77--97. Google ScholarDigital Library
- Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the presence of partial synchrony. Journal of the ACM 35, 2, 288--323. Google ScholarDigital Library
- Nazim Fatés. 2013. Stochastic cellular automata solutions to the density classification problem. Theory of Computing Systems 53, 2, 223--242.Google ScholarCross Ref
- Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1985. Impossibility of distributed consensus with one faulty process. Journal of the ACM 32, 2, 374--382. Google ScholarDigital Library
- Peter Gacs, Georgy L. Kurdyumov, and Leonid A. Levin. 1978. One-dimensional uniform arrays that wash out finite islands. Problemy Peredachi Informacii 14, 92--98.Google Scholar
- Alexander Galov and Alexey Moschevikin. 2013. Bayesian filters for ToF and RSS measurements for indoor positioning of a mobile object. In Proceedings of 2013 International Conference on Indoor Positioning and Indoor Navigation (IPIN). 1--8.Google ScholarCross Ref
- Andrew Gee and Roberto Cipolla. 1996. Fast visual tracking by temporal consensus. Image and Vision Computing 14, 2, 105--114.Google ScholarCross Ref
- Carlos Gershenson. 2004. Updating schemes in random Boolean networks: Do they really matter? In Proceedings of the International Conference on the Simulation and Synthesis of Living Systems. 238--243.Google Scholar
- Alexander Gogolev and Christian Bettstetter. 2012. Robustness of self-organizing consensus algorithms: Initial results from a simulation-based study. In Self-Organizing Systems. Lecture Notes in Computer Science, Vol. 7166. Springer, 104--108. Google ScholarDigital Library
- Alexander Gogolev and Lucio Marcenaro. 2014a. Density classification in asynchronous random networks with faulty nodes. In Proceedings of International Conference on Parallel, Distributed and Network-Based Processing. 256--261. Google ScholarDigital Library
- Alexander Gogolev and Lucio Marcenaro. 2014b. Randomized binary consensus with faulty nodes. Entropy 16, 2820--2838.Google ScholarCross Ref
- Minyi Huang and Jonathan H. Manton. 2007. Stochastic double array analysis and convergence of consensus algorithms with noisy measurements. In Proceedings of American Control Conference. 705--710.Google Scholar
- Hugues Juille and Jordan B. Pollack. 1998. Coevolving the “ideal” trainer: Application to the discovery of cellular automata rules. In Proceedings of the Annual Conference on Genetic Programming. 519--527.Google Scholar
- Soummya Kar and Jose M. F. Moura. 2007. Distributed average consensus in sensor networks with random link failures and communication channel noise. In Proceedings of Asilomar Conference on Signals, Systems and Computers. 676--680.Google Scholar
- Derek B. Kingston and Randall W. Beard. 2006. Discrete-time average consensus under switching network topologies. In Proceedings of American Control Conference. 3551--3556.Google Scholar
- Mark Land and Richard K. Belew. 1995. No perfect two-state cellular automata for density classification exists. Physical Review Letters E 74, 5148--5150.Google ScholarCross Ref
- Naomi E. Leonard, Tian Shen, Benjamin Nabet, Luca Scardovi, Iain D. Couzin, and Simon A. Levin. 2012. Decision versus compromise for animal groups in motion. Proceedings of the National Academy of Sciences 109, 1, 227--232.Google ScholarCross Ref
- Timothy Margush and Fred R. McMorris. 1981. Consensus n-trees. Bulletin of Mathematical Biology 43, 2, 239--244.Google Scholar
- Manuel Marques-Pita and Luis Mateus Rocha. 2008. Conceptual structure in cellular automata—the density classification task. In ALIFE. 390--397.Google Scholar
- J. Ricardo G. Mendonçia. 2011. Sensitivity to noise and ergodicity of an assembly line of cellular automata that classifies density. Physical Review Letters E 83, 3, 31112--31117.Google ScholarCross Ref
- Melanie Mitchell, James P. Crutchfield, and Peter T. Hraber. 1994. Evolving cellular automata to perform computations: Mechanisms and impediments. Physica D: Nonlinear Phenomena 75, 1--3, 361--391. Google ScholarDigital Library
- Melanie Mitchell, Peter T. Hraber, and James P. Crutchfield. 1993. Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems 7, 89--130.Google Scholar
- André A. Moreira, Abhishek Mathur, Daniel Diermeier, and Luís A. N. Amaral. 2004. Efficient system-wide coordination in noisy environments. Proceedings of the National Academy of Sciences of the United States of America 101, 33, 12085--12090.Google ScholarCross Ref
- Alexey Moschevikin, Alexander Galov, Sergey Reginya, Alexander Volkov, and Axel Sikora. 2013. The impact of NLOS components in Time-of-Flight networks for indoor positioning systems. In Proceedings of IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS), Vol. 01. 455--460.Google ScholarCross Ref
- Yasamin Mostofi and Richard M. Murray. 2009. Kalman filtering over wireless fading channels—How to handle packet drop. International Journal of Robust and Nonlinear Control 19, 18, 1993--2015.Google ScholarCross Ref
- Benjamin Nabet, Naomi E. Leonard, Iain D. Couzin, and Simon A. Levin. 2009. Dynamics of decision making in animal group motion. Journal of Nonlinear Science 19, 4, 399--435.Google ScholarCross Ref
- Reza Olfati-Saber and Jeff S. Shamma. 2005. Consensus filters for sensor networks and distributed sensor fusion. In Proceedings of IEEE Conference on Decision and Control and European Control Conference. 6698--6703.Google Scholar
- Marshall Pease, Robert Shostak, and Leslie Lamport. 1980. Reaching agreement in the presence of faults. Journal of the ACM 27, 2, 228--234. Google ScholarDigital Library
- Yongxiang Ruan and Yasamin Mostofi. 2008. Binary consensus with soft information processing in cooperative networks. In Proceedings of IEEE Conference on Decision and Control. 3613--3619.Google ScholarCross Ref
- Michael Saks, Nir Shavit, and Heather Woll. 1991. Optimal time randomized consensus-making resilient algorithms fast in practice. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms. 351--362. Google ScholarDigital Library
- Michael Saks and Fotios Zaharoglou. 1993. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings of the ACM Symposium on Theory of Computing. 101--110. Google ScholarDigital Library
- Andrea Simonetto, Tamas Keviczky, and Robert Babuska. 2010. Distributed nonlinear estimation for robot localization using weighted consensus. In Proceedings of IEEE International Conference on Robotics and Automation. 3026--3031.Google ScholarCross Ref
- Mieko Tanaka-Yamawaki, Sachiko Kitamikado, and Toshio Fukuda. 1996. Consensus formation and the cellular automata. Robotics and Autonomous Systems 19, 1, 15--22.Google ScholarCross Ref
- Andrew S. Tanenbaum and Maarten van Steen. 2010. Distributed Systems: Principles and Paradigms (3rd ed.). Prentice-Hall, Inc. Upper Saddle River, NJ.Google Scholar
- János Török, Gerardo Iñiguez, Taha Yasseri, Maxi San Miguel, Kimmo Kaski, and János Kertész. 2013. Opinions, conflicts, and consensus: Modelling social dynamics in a collaborative environment. Physical Review Letters 110, 8, 88701--88708.Google ScholarCross Ref
- Piet Van Mieghem. 2001. Paths in the simple random graph and the Waxman graph. Probability in the Engineering and Informational Sciences 15, 4, 535--555. Google ScholarDigital Library
- Igor G. Vladimirov and Phil Diamond. 2002. A uniform white-noise model for fixed-point roundoff errors in digital systems. Automation and Remote Control 63, 5, 753--765. Google ScholarDigital Library
- Duncan J. Watts and Steven H. Strogatz. 1998. Collective dynamics of “small-world” networks. Nature 393, 6684, 440--442.Google Scholar
- Bernard M. Waxman. 1988. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6, 9, 1617--1622. Google ScholarDigital Library
- Dietmar Wolz and Pedro De Oliveira. 2008. Very effective evolutionary techniques for searching cellular automata rule spaces. Journal of Cellular Automata 3, 4, 289--312.Google Scholar
- Xin-She Yang. 2001. Small-world networks in geophysics. Geophysical Research Letters 28, 13, 2549--2552.Google ScholarCross Ref
Index Terms
- Distributed Binary Consensus in Networks with Disturbances
Recommendations
Density Classification in Asynchronous Random Networks with Faulty Nodes
PDP '14: Proceedings of the 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based ProcessingThis paper investigates distributed consensus for density classification in asynchronous random networks with faulty nodes. We compare four different models of faulty behavior under randomized topology. Using computer simulations, we show that (a) ...
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with ...
Faster randomized consensus with an oblivious adversary
PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computingTwo new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with ...
Comments