Self-Tuning Distributed Fusion Filter for Multi-Sensor Networked Systems with Unknown Packet Receiving Rates, Noise Variances, and Model Parameters

Distributed Optimal and Self-Tuning Filters Based on Compressed Data for Networked Stochastic Uncertain Systems with Deception Attacks

In this study, distributed security estimation problems for networked stochastic uncertain systems subject to stochastic deception attacks are investigated. In sensor networks, the measurement data of sensor nodes may be attacked maliciously in the process of data exchange between sensors. When the attack rates and noise variances for the stochastic deception attack signals are known, many measurement data received from neighbour nodes are compressed by a weighted measurement fusion algorithm based on the least-squares method at each sensor node. A distributed optimal filter in the linear minimum variance criterion is presented based on compressed measurement data. It has the same estimation accuracy as and lower computational cost than that based on uncompressed measurement data. When the attack rates and noise variances of the stochastic deception attack signals are unknown, a correlation function method is employed to identify them. Then, a distributed self-tuning filter is obtained by substituting the identified results into the distributed optimal filtering algorithm. The convergence of the presented algorithms is analyzed. A simulation example verifies the effectiveness of the proposed algorithms.

Two Compensation Strategies for Optimal Estimation in Sensor Networks with Random Matrices, Time-Correlated Noises, Deception Attacks and Packet Losses

Due to its great importance in several applied and theoretical fields, the signal estimation problem in multisensor systems has grown into a significant research area. Networked systems are known to suffer random flaws, which, if not appropriately addressed, can deteriorate the performance of the estimators substantially. Thus, the development of estimation algorithms accounting for these random phenomena has received a lot of research attention. In this paper, the centralized fusion linear estimation problem is discussed under the assumption that the sensor measurements are affected by random parameter matrices, perturbed by time-correlated additive noises, exposed to random deception attacks and subject to random packet dropouts during transmission. A covariance-based methodology and two compensation strategies based on measurement prediction are used to design recursive filtering and fixed-point smoothing algorithms. The measurement differencing method-typically used to deal with the measurement noise time-correlation-is unsuccessful for these kinds of systems with packet losses because some sensor measurements are randomly lost and, consequently, cannot be processed. Therefore, we adopt an alternative approach based on the direct estimation of the measurement noises and the innovation technique. The two proposed compensation scenarios are contrasted through a simulation example, in which the effect of the different uncertainties on the estimation accuracy is also evaluated.

Globally Optimal Distributed Fusion Filter for Descriptor Systems with Time-Correlated Measurement Noises

This paper concerns the distributed fusion filtering problem for descriptor systems with time-correlated measurement noises. The original descriptor is transformed into two reduced-order subsystems (ROSs) based on singular value decomposition. For the first ROS, a new measurement is obtained using measurement difference technology. Each sensor produces a local filter based on the fusion predictor from the fusion center and its own new measurement and then sends it to the fusion center. In the fusion center, based on local filters, a distributed fusion filter with feedback (DFFWF) in the linear minimum variance (LMV) sense is proposed by applying an innovative approach. The DFFWF for the second ROS is also obtained based on the DFFWF for the first ROS. Then, the DFFWF for the original descriptor is obtained. The proposed DFFWF can achieve the same estimation accuracy as the centralized fusion filter (CFF) under the condition that all local filter gain matrices are of full column rank. Its optimality is strictly proved. Moreover, it has robustness and reliability due to the parallel processing of local filters. Two simulation examples demonstrate the effectiveness of the developed fusion algorithm.

A Two-Phase Distributed Filtering Algorithm for Networked Uncertain Systems with Fading Measurements under Deception Attacks

In this paper, the distributed filtering problem is addressed for a class of discrete-time stochastic systems over a sensor network with a given topology, susceptible to suffering deception attacks, launched by potential adversaries, which can randomly succeed or not with a known success probability, which is not necessarily the same for the different sensors. The system model integrates some random imperfections and features that are frequently found in real networked environments, namely: (1) fading measurements; (2) multiplicative noises in both the state and measurement equations; and (3) sensor additive noises cross-correlated with each other and with the process noise. According to the network communication scheme, besides its own local measurements, each sensor receives the measured outputs from its adjacent nodes. Based on such measurements, a recursive algorithm is designed to obtain the least-squares linear filter of the state. Thereafter, each sensor receives the filtering estimators previously obtained by its adjacent nodes, and these estimators are all fused to obtain the desired distributed filter as the minimum mean squared error matrix-weighted linear combination of them. The theoretical results are illustrated by a simulation example, where the efficiency of the developed distributed estimation strategy is discussed in terms of the error variances.