Distributed state-saturation secure filtering under Round-Robin protocol and deception attacks

Abstract

The distributed secure filtering issue is concerned for discrete time-varying systems with state-saturation constraints subjected to both deception attacks and Round-Robin (RR) protocol over sensor networks in this paper. Firstly, the phenomenon of state-saturation, a prevalent issue encountered in real-world projects, is considered in this paper. In order to reduce the burden on the network, the RR protocol is introduced to determine which sensor node is connected to the network at each transmission moment. Subsequently, the randomness of the occurrence of deception attacks is modeled in this paper, with each event being assigned a specific probability through the utilization of a series of Bernoulli-distributed white sequences. Next, a sufficient condition for the expectation filter to satisfy the prediction error variance requirement is obtained based on the recursive linear matrix inequality (RLMI) method. Based on this, an optimization problem is created to find the filtering parameters that guarantee locally optimal filtering performance at every moment. Ultimately, the efficacy of the proposed algorithm is substantiated through a series of illustrative simulation scenarios.