On the security of linear consensus networks

This work considers the problem of reaching consensus in linear networks with misbehaving agents. A solution to this problem is relevant for several tasks in multiagent systems including motion coordination, clock synchronization, and cooperative estimation. By modelling the misbehaving nodes as unknown and unmeasurable inputs affecting the network, we recast the problem into a system theoretic framework. Only relying on their direct measurements, the agents detect and identify uncooperative behaviors using fault detection and isolation techniques. We consider both the cases of Byzantine as well as non-colluding faults, and we express the solvability conditions of the two cases in terms of the observability properties of a linear system associated with the network, and from a graph theoretic perspective. It is shown that generically any node can correctly detect and identify the misbehaving agents, provided that the connectivity of the network is sufficiently high. Precisely, for a linear consensus network to be generically resilient to k concurrent faults, the connectivity of the communication graph needs to be 2k+1, if Byzantine agents are allowed, and k+1, if non-colluding agents are considered.

[1]  C.N. Hadjicostis,et al.  Distributed function calculation via linear iterations in the presence of malicious agents — Part I: Attacking the network , 2008, 2008 American Control Conference.

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

[3]  A. Willsky,et al.  Failure detection and identification , 1989 .

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

[5]  W. Wonham.  Linear Multivariable Control: A Geometric Approach , 1974 .

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

[7]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

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

[9]  G. Basile,et al.  Controlled and conditioned invariants in linear system theory , 1992 .

[10]  Wei Ren,et al.  Information consensus in multivehicle cooperative control , 2007, IEEE Control Systems.

[11]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[12]  Paul M. Frank,et al.  Fault diagnosis in dynamic systems: theory and application , 1989 .

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

[14]  Christian Commault,et al.  Generic properties and control of linear structured systems: a survey , 2003, Autom..

[15]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[16]  Harry L. Trentelman,et al.  Control theory for linear systems , 2002 .

[17]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[18]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .