Scalable consensus filtering for uncertain systems over sensor networks with Round‐Robin protocol

Abstract

This article is concerned with the scalable distributed H∞‐consensus filtering problem for a class of discrete time‐varying systems over sensor networks with the Round‐Robin protocol (RRP). The challenge comes from the fact that the time‐varying parameters of the network are subject to randomly occurring norm‐bounded uncertainties and the measurement outputs of the sensor nodes are saturated due to the sector nonlinearities. For preventing data collisions and saving energy, the RRP determines which neighboring node can access the shared network for information transmission at each time step. An H∞ performance index is proposed to characterize the disturbance attenuation level of the resulting filtering error dynamics. By stochastic analysis in combination with the recursive matrix inequality approach, a distributed filtering algorithm is developed for each individual sensor node to ensure the prespecified estimation performance. Finally, an illustrative simulation example is shown to verify the effectiveness and applicability of the theoretical results.

Sliding mode control for multi‐agent systems under stochastic communication protocol

“…[17][18][19] However, real-time information transmission will exacerbate the stress of communication network with limited bandwidth, if the transmission network is granted to all nodes at the same time. A good way is to use the scheduling protocol to coordinate the signal transmission among system components, such as the round-robin (RR) protocol, [20][21][22][23][24] the weighted try-once-discard (WTOD) protocol, [25][26][27] and the stochastic communication protocol (SCP). 28,29 Under the SCP, only one sensor can obtain permission to the communication network and transmit its signal, and the signals from other sensors cannot get permission to the network at each instant, see the relevant works on fuzzy systems, 30 stochastic systems, 31,32 and so on.…”

“…However, real‐time information transmission will exacerbate the stress of communication network with limited bandwidth, if the transmission network is granted to all nodes at the same time. A good way is to use the scheduling protocol to coordinate the signal transmission among system components, such as the round‐robin (RR) protocol, 20‐24 the weighted try‐once‐discard (WTOD) protocol, 25‐27 and the stochastic communication protocol (SCP) 28,29 …”

Robust distributed filtering for sensor networks under parametric uncertainties

“…On the other hand, Shen, Wang and Hung (2010), Dong, Ding and Ren (2014), Hedayati andHan et al (2021) proposed H ∞ -consensus filters to handle norm-bounded uncertainties. The first three also deal with the missing measurements problem.…”