Distributed Binary Consensus in Networks with Disturbances

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.

[1]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[2]  Abhishek Mathur,et al.  Efficient system-wide coordination in noisy environments. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[3]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[4]  R. Olfati-Saber,et al.  Consensus Filters for Sensor Networks and Distributed Sensor Fusion , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[5]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[6]  Ophir Rachman,et al.  Randomized Consensus in Expected O(n²log n) Operations , 1991, WDAG.

[7]  Fred R. McMorris,et al.  Consensusn-trees , 1981 .

[8]  Naomi Ehrich Leonard,et al.  Convergence in human decision-making dynamics , 2010, Syst. Control. Lett..

[9]  Nazim Fatès,et al.  Stochastic Cellular Automata Solutions to the Density Classification Problem , 2012, Theory of Computing Systems.

[10]  Soummya Kar,et al.  Distributed Average Consensus in Sensor Networks with Random Link Failures and Communication Channel Noise , 2007, 2007 Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers.

[11]  Alex Moschevikin,et al.  Bayesian filters for ToF and RSS measurements for indoor positioning of a mobile object , 2013, International Conference on Indoor Positioning and Indoor Navigation.

[12]  Lucio Marcenaro,et al.  Randomized Binary Consensus with Faulty Agents , 2014, Entropy.

[13]  Sam Toueg,et al.  Asynchronous consensus and broadcast protocols , 1985, JACM.

[14]  Christian Bettstetter,et al.  Robustness of Self-Organizing Consensus Algorithms: Initial Results from a Simulation-Based Study , 2012, IWSOS.

[15]  Naomi Ehrich Leonard,et al.  Integrating human and robot decision-making dynamics with feedback: Models and convergence analysis , 2008, 2008 47th IEEE Conference on Decision and Control.

[16]  Marcos K. Aguilera,et al.  The correctness proof of Ben-Or’s randomized consensus algorithm , 2012, Distributed Computing.

[17]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[18]  Melanie Mitchell,et al.  Evolving cellular automata to perform computations: mechanisms and impediments , 1994 .

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  Jonathan P. How,et al.  An unbiased Kalman consensus algorithm , 2006, 2006 American Control Conference.

[21]  J. R. G. Mendonça,et al.  Sensitivity to noise and ergodicity of an assembly line of cellular automata that classifies density. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Lucio Marcenaro,et al.  Density Classification in Asynchronous Random Networks with Faulty Nodes , 2014, 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[23]  Igor G. Vladimirov,et al.  A Uniform White-Noise Model for Fixed-Point Roundoff Errors in Digital Systems , 2002 .

[24]  R.W. Beard,et al.  Discrete-time average-consensus under switching network topologies , 2006, 2006 American Control Conference.

[25]  P. V. Mieghem,et al.  PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH , 2001, Probability in the Engineering and Informational Sciences.

[26]  J. Pollack,et al.  Coevolving the "Ideal" Trainer: Application to the Discovery of Cellular Automata Rules , 1998 .

[27]  Danny Dolev,et al.  On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[28]  James P. Crutchfield,et al.  Evolving Globally Synchronized Cellular Automata , 1995, ICGA.

[29]  Maxi San Miguel,et al.  Opinions, Conflicts and Consensus: Modeling Social Dynamics in a Collaborative Environment , 2012, Physical review letters.

[30]  Land,et al.  No perfect two-state cellular automata for density classification exists. , 1995, Physical review letters.

[31]  James Aspnes,et al.  Randomized protocols for asynchronous consensus , 2002, Distributed Computing.

[32]  Andrew S. Tanenbaum,et al.  Distributed systems: Principles and Paradigms , 2001 .

[33]  F. H. Bennett,et al.  Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem , 1996 .

[34]  James Aspnes,et al.  Fast deterministic consensus in a noisy environment , 2000, PODC '00.

[35]  J.H. Manton,et al.  Stochastic Double Array Analysis and Convergence of Consensus Algorithms with Noisy Measurements , 2007, 2007 American Control Conference.

[36]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[37]  Mieko Tanaka-Yamawaki,et al.  Consensus formation and the cellular automata , 1996, Robotics Auton. Syst..

[38]  Naomi Ehrich Leonard,et al.  Decision versus compromise for animal groups in motion , 2011, Proceedings of the National Academy of Sciences.

[39]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[40]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[41]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[42]  Richard M. Murray,et al.  Kalman filtering over wireless fading channels—How to handle packet drop , 2009 .

[43]  Luis Mateus Rocha,et al.  Conceptual Structure in Cellular Automata - The Density Classification Task , 2008, ALIFE.

[44]  Xin-She Yang,et al.  Small‐world networks in geophysics , 2001, 1003.4886.

[45]  Naomi Ehrich Leonard,et al.  Dynamics of Decision Making in Animal Group Motion , 2009, J. Nonlinear Sci..

[46]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[47]  James P. Crutchfield,et al.  Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations , 1993, Complex Syst..

[48]  Yongxiang Ruan,et al.  Binary consensus with soft information processing in cooperative networks , 2008, 2008 47th IEEE Conference on Decision and Control.

[49]  Nir Shavit,et al.  Optimal time randomized consensus—making resilient algorithms fast in practice , 1991, SODA '91.

[50]  Boaz Patt-Shamir,et al.  Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus , 2005, OPODIS.

[51]  Roberto Cipolla,et al.  Fast visual tracking by temporal consensus , 1996, Image Vis. Comput..

[52]  Axel Sikora,et al.  The impact of NLOS components in Time-of-Flight networks for indoor positioning systems , 2013, 2013 IEEE 7th International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS).

[53]  Carlos Gershenson,et al.  Updating Schemes in Random Boolean Networks: Do They Really Matter? , 2004, ArXiv.

[54]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[55]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[56]  Robert Babuska,et al.  Distributed nonlinear estimation for robot localization using weighted consensus , 2010, 2010 IEEE International Conference on Robotics and Automation.

[57]  Pedro P. B. de Oliveira,et al.  Very Effective Evolutionary Techniques for Searching Cellular Automata Rule Spaces , 2008, J. Cell. Autom..