Robust Intrusion Detection in Dynamic Networks

This paper considers the problem of robustly identifying m intruders in a network consisting of n cooperative agents which are subject to unknown disturbances. First, a distributed system model is introduced so that the relationship between agents, the attacks and unknown disturbances can be capture...

Full description

Saved in:
Bibliographic Details
Published in2019 IEEE Conference on Control Technology and Applications (CCTA) pp. 988 - 993
Main Authors Nazari, Sam, Shafai, Bahram, Moradmand, Anahita
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2019
Subjects
Generators
Laplace equations
Mathematical model
Monitoring
Nickel
Observers
Robustness
Online AccessGet full text

Cover

More Information
Summary:This paper considers the problem of robustly identifying m intruders in a network consisting of n cooperative agents which are subject to unknown disturbances. First, a distributed system model is introduced so that the relationship between agents, the attacks and unknown disturbances can be captured. Next, the distributed identification scheme is formulated as a spectral assignment problem and necessary filter gains are obtained through a carefully constructed linear system of equations. Necessary and sufficient conditions to decouple the unknown disturbances from the agents residual generators are derived in terms of filter gain matrices. It is shown that the problem of discriminating between unknown disturbances and attacks in a distributed system under consensus dynamics can be reduced to the problem of determining a set of constraints on the spectrum of the residual generator coefficient matrices. The approach is illustrated through an example.
DOI:10.1109/CCTA.2019.8920506