Further considerations on the intrusion detection in an average consensus networked system: Multinode design for acyclic graphs

In the present paper the problem of intrusion detection and isolation for a networked system with acyclic communication graph subject to the presence of an eventual fault/intrusion is considered. Necessary and sufficient conditions for the selection of the monitoring node set are provided for a generic acyclic graph and a procedure to effectively perform detection and localization is given. The solution has the architecture of a collaborative multinode with precise and easy instructions for each node of the monitoring network. Simulations are made in order to validate theoretical results.