Distributed intrusion detection for secure consensus computations

This paper focuses on trustworthy computation systems and proposes a novel intrusion detection scheme for linear consensus networks with misbehaving nodes. This prototypical control problem is relevant in network security applications. The objective is for each node to detect and isolate the misbehaving nodes using only the information flow adopted by standard consensus protocols. We focus on the single misbehaving node problem. Our technical approach is based on the theory of unknown input observability. First, we give necessary and sufficient conditions for the misbehavior to be observable and for the identity of the faulty node to be detectable. Second, we design a distributed unknown input estimator, and we characterize its convergence rate in the "equal-neighbor" model and in the general case. Third and finally, we propose a complete detection and isolation scheme and provide some remarks on the filter convergence time. We conclude the paper with the numerical study of a consensus problem and of a robotic deployment problem.

[1]  Stephen P. Boyd,et al.  Distributed Average Consensus with Time-Varying Metropolis Weights ? , 2006 .

[2]  Francesco Bullo,et al.  Optimal sensor placement and motion coordination for target tracking , 2006, Autom..

[3]  R. Olfati-Saber,et al.  Distributed Fault Diagnosis using Sensor Networks and Consensus-based Filters , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[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]  F. Bullo,et al.  On collective motion in sensor networks: sample problems and distributed algorithms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[6]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[8]  Sonja Buchegger,et al.  Cooperative Routing in Mobile Ad-hoc Networks: Current Efforts Against Malice and Selfishness , 2002, GI Jahrestagung.

[9]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[10]  Stephen P. Boyd,et al.  A space-time diffusion scheme for peer-to-peer least-squares estimation , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

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

[12]  Yanbin Liu,et al.  Reputation propagation and agreement in mobile ad-hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[13]  Emilio Frazzoli,et al.  On synchronous robotic networks Part II: Time complexity of rendezvous and deployment algorithms , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[14]  Julia K. Parrish,et al.  Extracting Interactive Control Algorithms from Group Dynamics of Schooling Fish , 2005 .

[15]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[16]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[17]  J.N. Tsitsiklis,et al.  Convergence Rates in Distributed Consensus and Averaging , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

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

[20]  P. Frank,et al.  Survey of robust residual generation and evaluation methods in observer-based fault detection systems , 1997 .

[21]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[22]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[23]  Emilio Frazzoli,et al.  On synchronous robotic networks Part I: Models, tasks and complexity notions , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[24]  A. Odlyzko,et al.  Bounds for eigenvalues of certain stochastic matrices , 1981 .

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

[26]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[27]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[28]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

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

[30]  Jean-Yves Le Boudec,et al.  Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.