Scalable Distributed Estimation for Time-Varying System With Generalized Weighted Try-Once-Discard and Round-Robin Protocols

This paper addresses the distributed H<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub>-consensus estimation problem for a class of discrete time-varying systems with integral measurements under the schedule of both the generalized Weighted Try-Once-Discard (WTOD) protocol and the Round-Robin (RR) protocol. The system and the integral measurement of each node are first formulated and the lifting technique is then employed to obtain a new delay-free state space model. The WTOD protocol determines multiple elements of measurement to be transmitted to the estimator and the RR protocol chooses multiple neighboring nodes to transmit its information, which are helpful to achieve the desired filtering performance in a flexible manner. By means of the protocol schedule, the distributed estimator is designed by leveraging the available information from the sensor and its neighboring nodes. A finite-horizon H<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub>-consensus performance constraint is introduced to evaluate both estimation error of each node and the consensus errors between neighboring nodes. Using the local performance analysis method inspired by stochastic vector dissipation, a set of locally sufficient conditions is constructed for each node such that the estimation error dynamics satisfy the H<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub>-consensus performance constraint over the finite horizon. Furthermore, the desirable estimator parameters are calculated at each node upon receiving the necessary information via the shared channel. For each node, an optimization problem subject to the feasible local conditions is established by minimizing the noise attenuation level, which is implemented in a fully distributed manner. Finally, the effectiveness and applicability of the distributed estimation algorithm developed in this paper are demonstrated by an illustrative simulation.

Authors

Institutions

Publication Details

Journal
IEEE Sensors Journal
Published
2025-06-27
DOI
https://doi.org/10.1109/jsen.2025.3582166
Citations
1
Primary Topic
Network Time Synchronization Technologies
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Distributed Estimation for Time-Varying System With Generalized Weighted Try-Once-Discard and Round-Robin Protocols

Yuxuan Shen, Yanhua Song, Fei Han, Hongli Dong et al.
1 citations
IEEE Sensors Journal
Network Time Synchronization Technologies
1.49
article

Scalable Distributed Estimation for Time-Varying System With Generalized Weighted Try-Once-Discard and Round-Robin Protocols

Yuxuan Shen, Yanhua Song, Fei Han, Hongli Dong, Zhongrui Hu, Jinnan Zhang
article en
1 citations

Abstract

This paper addresses the distributed H<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub>-consensus estimation problem for a class of discrete time-varying systems with integral measurements under the schedule of both the generalized Weighted Try-Once-Discard (WTOD) protocol and the Round-Robin (RR) protocol. The system and the integral measurement of each node are first formulated and the lifting technique is then employed to obtain a new delay-free state space model. The WTOD protocol determines multiple elements of measurement to be transmitted to the estimator and the RR protocol chooses multiple neighboring nodes to transmit its information, which are helpful to achieve the desired filtering performance in a flexible manner. By means of the protocol schedule, the distributed estimator is designed by leveraging the available information from the sensor and its neighboring nodes. A finite-horizon H<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub>-consensus performance constraint is introduced to evaluate both estimation error of each node and the consensus errors between neighboring nodes. Using the local performance analysis method inspired by stochastic vector dissipation, a set of locally sufficient conditions is constructed for each node such that the estimation error dynamics satisfy the H<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub>-consensus performance constraint over the finite horizon. Furthermore, the desirable estimator parameters are calculated at each node upon receiving the necessary information via the shared channel. For each node, an optimization problem subject to the feasible local conditions is established by minimizing the noise attenuation level, which is implemented in a fully distributed manner. Finally, the effectiveness and applicability of the distributed estimation algorithm developed in this paper are demonstrated by an illustrative simulation.

IEEE Sensors JournalVol. 25(16)
Northeast Petroleum University (CN)
Openalex Percentile: Top 16%
Network Time Synchronization Technologies
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.