计算机科学
计算机网络
分布式计算
密码学
计算机安全
Byzantine容错
电子邮件
算法设计
分布式数据库
拜占庭式建筑
入侵检测系统
滤波理论
服务器
信号处理
实时计算
网络安全
作者
林達聰,Jinling Liang,Guoqiang Long
标识
DOI:10.1109/jiot.2026.3730735
摘要
This study focuses on the design of set-membership estimators for two-dimensional systems that are vulnerable to both the dynamic uniform quantization effects and the Byzantine attacks. A two-step distributed filter is proposed, which comprehensively accounts for impacts of both the Byzantine attacks and the uniform quantization. Specifically, by performing an in-depth analysis of the trimmed mean in the presence of Byzantine attacks, we establish the piecewise compact error bounds and subsequently determine the most suitable trimming parameters. On this basis, an ellipsoidal boundary processing scheme tailored by the trimmed mean method is developed. By leveraging theS-procedure and the Schur complement lemma, sufficient conditions are formulated to guarantee the inclusion of the true system state within the bounding ellipsoid. Furthermore, the optimal parameters of the filter are calculated through an optimization process aimed at minimizing the trace of the ellipsoidal matrix. To validate the theoretical criteria and illustrate the practical performance of the designed filtering strategy, a numerical example is presented at the end of this paper.
科研通智能强力驱动
Strongly Powered by AbleSci AI