Robustness of information diffusion algorithms to locally bounded adversaries

We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in its neighborhood. We introduce a topological property known as r-robustness of a graph, and show that this property provides improved bounds on tolerating malicious behavior, in comparison to traditional concepts such as connectivity and minimum degree. We use this topological property to analyze the canonical problems of distributed consensus and broadcast, and provide sufficient conditions for these operations to succeed. Finally, we provide a construction for r-robust graphs and show that the common preferential-attachment model for scale-free networks produces a robust graph.

[1]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  Roger M. Kieckhafer,et al.  Reaching Approximate Agreement with Mixed-Mode Faults , 1994, IEEE Trans. Parallel Distributed Syst..

[3]  Shreyas Sundaram,et al.  Consensus of multi-agent networks in the presence of adversaries using only local information , 2012, HiCoNS '12.

[4]  R.M. Murray,et al.  On the robustness of distributed algorithms , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[5]  Boleslaw K. Szymanski,et al.  Social consensus through the influence of committed minorities , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Andrzej Pelc,et al.  Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..

[7]  J. Wolfowitz.  Products of indecomposable, aperiodic, stochastic matrices , 1963 .

[8]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[9]  André Teixeira,et al.  Networked control systems under cyber attacks with applications to power networks , 2010, Proceedings of the 2010 American Control Conference.

[10]  Dirk A. Lorenz,et al.  On Conditions for Convergence to Consensus , 2008, IEEE Transactions on Automatic Control.

[11]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[12]  Jon M. Kleinberg,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World [Book Review] , 2013, IEEE Technol. Soc. Mag..

[13]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[14]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[15]  Xenofon Koutsoukos,et al.  Consensus in networked multi-agent systems with adversaries , 2011 .

[16]  Andrzej Pelc,et al.  Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[17]  Chiu-Yuen Koo,et al.  Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.

[18]  R. Kieckhafer,et al.  Low Cost Approximate Agreement In Partially Connected Networks , 1993 .

[19]  H. Bajwa,et al.  Global convergence in partially fully connected networks (PFCN) with limited relays , 2001, IECON'01. 27th Annual Conference of the IEEE Industrial Electronics Society (Cat. No.37243).

[20]  Shreyas Sundaram,et al.  Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents , 2011, IEEE Transactions on Automatic Control.

[21]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[22]  Xenofon D. Koutsoukos,et al.  Low complexity resilient consensus in networked multi-agent systems with adversaries , 2012, HSCC '12.

[23]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[24]  Azad H. Azadmanesh,et al.  Fault Tolerant Weighted Voting Algorithms , 2008, Int. J. Netw. Secur..

[25]  John N. Tsitsiklis,et al.  On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity , 2008, IEEE Transactions on Automatic Control.

[26]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[27]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Rainer Hegselmann,et al.  Opinion dynamics and bounded confidence: models, analysis and simulation , 2002, J. Artif. Soc. Soc. Simul..

[29]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[30]  Maiko Shigeno,et al.  A new parameter for a broadcast algorithm with locally bounded Byzantine faults , 2010, Inf. Process. Lett..

[31]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[32]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[33]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[34]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[35]  Mehran Mesbahi,et al.  Semi-autonomous networks: Network resilience and adaptive trees , 2010, 49th IEEE Conference on Decision and Control (CDC).

[36]  Muhammad Sahimi,et al.  Can a few fanatics influence the opinion of a large segment of a society? , 2005, physics/0506154.

[37]  Xenofon D. Koutsoukos,et al.  Low complexity resilient consensus in networked multi-agent systems with adversaries , 2012, HSCC.

[38]  Shreyas Sundaram,et al.  Distributed function calculation and consensus using linear iterative strategies , 2008, IEEE Journal on Selected Areas in Communications.

[39]  Antonio Bicchi,et al.  Consensus Computation in Unreliable Networks: A System Theoretic Approach , 2010, IEEE Transactions on Automatic Control.