Distributed function calculation via linear iterations in the presence of malicious agents — Part I: Attacking the network

We consider the problem of distributed function calculation in the presence of faulty or malicious agents. In particular, we consider a setup where each node has an initial value and the goal is for (a subset of) the nodes to calculate a function of these values in a distributed manner. We focus on linear iterative strategies for function calculation, where each node updates its value at each time-step to be a weighted average of its own previous value and those of its neighbors; after a sufficiently large number of time-steps, each node is expected to have enough information to calculate the desired function of the initial node values. We study the susceptibility of such strategies to misbehavior by some nodes in the network; specifically, we consider a node to be malicious if it updates its value arbitrarily at each time-step, instead of following the predefined linear iterative strategy. If the connectivity of the network topology is 2f or less, we show that it is possible for a set of f malicious nodes to conspire in a way that makes it impossible for a subset of the other nodes in the network to correctly calculate an arbitrary function of all node values. Our analysis is constructive, in that it provides a specific scheme for the malicious nodes to follow in order to obfuscate the network in this fashion.

[1]  C.N. Hadjicostis,et al.  Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies , 2007, 2007 American Control Conference.

[2]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[3]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

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

[5]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

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

[7]  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.

[8]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[9]  Antonio Bicchi,et al.  Distributed intrusion detection for secure consensus computations , 2007, 2007 46th IEEE Conference on Decision and Control.

[10]  C.N. Hadjicostis,et al.  Distributed function calculation via linear iterations in the presence of malicious agents — Part II: Overcoming malicious behavior , 2008, 2008 American Control Conference.

[11]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[12]  S. Sundaram,et al.  Distributed Consensus and Linear Functional Calculation in Networks: An Observability Perspective , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[13]  Chi-Tsong Chen,et al.  Linear System Theory and Design , 1995 .

[14]  Christoforos N. Hadjicostis,et al.  Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems , 2001, The Kluwer international series in engineering and computer science.