.png){kind=icon}
.png){kind=icon}
Return
Distributed Secure Consensus Filtering for Complex Dynamical Systems Under Round-Robin Protocol
.png){kind=icon}
PRE
AI
DOI：10.1002/acs.70065.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, the issue with respect to distributed consensus filtering (DCF) is investigated within the context of complex dynamical systems influenced by round-robin protocol (RRP) and DoS attack. To enhance communication efficacy, the RRP is deployed in the transmission channel to schedule data transmission. Owing to opening yet shared network environment, the DoS attack might appear in the transmission channel, which is depicted through a set of Bernoulli distributed stochastic variables. The aim of this investigation is to propose a new DCF algorithm that guarantees the presence of an upper bound regarding filtering error covariance (UBFEC). This UBFEC can be computed via solving matrix difference equations and optimized by choosing a suitable filter gain. Moreover, the monotonicity between the DCF algorithm performance and DoS attack probability is analyzed from a theoretical perspective. Lastly, two simulation examples are adopted to clarify the validity associated with the presented DCF algorithm.
Keywords:
distributed consensus filtering
DoS attack
monotonicity analysis
round-robin protocol
sensor networks
Journal
IF:
3.8
Papers:
2.6K
Citations:
3.6K
View more organizations