In this paper we consider the distributed consensus-based filtering problem for linear time-invariant systems over sensor networks subject to random link failures when the failure sequence is not known at the receiving side. We assume that the information exchanged, traveling along the channel, is corrupted by a noise and hence, it is no more possible to discriminate with certainty if a link failure has occurred. Therefore, in order to process the only significant information, we endow each sensor with detectors which decide on the presence of link failures. At each sensor the proposed approach consists of three steps: failure detection, local data aggregation and Kalman consensus filtering. Numerical examples show the effectiveness of this method.
Distributed Kalman Filtering over Sensor Networks with Unknown Random Link Failures
CACACE F;
2018-01-01
Abstract
In this paper we consider the distributed consensus-based filtering problem for linear time-invariant systems over sensor networks subject to random link failures when the failure sequence is not known at the receiving side. We assume that the information exchanged, traveling along the channel, is corrupted by a noise and hence, it is no more possible to discriminate with certainty if a link failure has occurred. Therefore, in order to process the only significant information, we endow each sensor with detectors which decide on the presence of link failures. At each sensor the proposed approach consists of three steps: failure detection, local data aggregation and Kalman consensus filtering. Numerical examples show the effectiveness of this method.File | Dimensione | Formato | |
---|---|---|---|
DistributedKalmanV4_earlyaccess.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Copyright dell'editore
Dimensione
452.7 kB
Formato
Adobe PDF
|
452.7 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.