TY - JOUR
T1 - Resilient Distributed Multi-task Estimation with Network Learning under Malicious Attacks
AU - Hua, Yi
AU - Wan, Fangyi
AU - Zhang, Youmin
AU - Qing, Xinlin
AU - Gan, Hongping
N1 - Publisher Copyright:
© 2004-2012 IEEE.
PY - 2026
Y1 - 2026
N2 - Network security plays a critical role in distributed estimation. When a multi-task distributed network is subjected to adversarial attacks, normal nodes are forced to both detect malicious nodes and learn cluster membership. The existing distributed algorithms, which mainly rely on some prior information and operate mechanically, remain insufficient and lack adaptability. To solve these problems, an adaptive distributed multi-task algorithm with cluster learning is proposed, which can make all normal nodes achieve resilience and secure estimation. In the proposed algorithm, an adaptive detection mechanism without any prior information is firstly proposed to identify the difference among nodes. Subsequently, a node queue strategy is designed to enable all normal nodes to obtain resilience and cluster learning. The convergence behavior of the proposed algorithm is analyzed, and then a convergence condition is derived to ensure the mean stability and mean-square convergence. Finally, based on different forms of data tampering and forgery, simulations consider three typical and distinct attacks. The results show that the proposed algorithm, without using any prior information, outperforms state-of-the-art algorithms, demonstrating the superior adaptability and effectiveness.
AB - Network security plays a critical role in distributed estimation. When a multi-task distributed network is subjected to adversarial attacks, normal nodes are forced to both detect malicious nodes and learn cluster membership. The existing distributed algorithms, which mainly rely on some prior information and operate mechanically, remain insufficient and lack adaptability. To solve these problems, an adaptive distributed multi-task algorithm with cluster learning is proposed, which can make all normal nodes achieve resilience and secure estimation. In the proposed algorithm, an adaptive detection mechanism without any prior information is firstly proposed to identify the difference among nodes. Subsequently, a node queue strategy is designed to enable all normal nodes to obtain resilience and cluster learning. The convergence behavior of the proposed algorithm is analyzed, and then a convergence condition is derived to ensure the mean stability and mean-square convergence. Finally, based on different forms of data tampering and forgery, simulations consider three typical and distinct attacks. The results show that the proposed algorithm, without using any prior information, outperforms state-of-the-art algorithms, demonstrating the superior adaptability and effectiveness.
KW - adaptive detection
KW - Attack intrusion
KW - cluster learning
KW - distributed estimation
KW - malicious node identification
KW - network security
KW - resilient algorithm
KW - secure data fusion
UR - https://www.scopus.com/pages/publications/105042686950
U2 - 10.1109/TDSC.2026.3704559
DO - 10.1109/TDSC.2026.3704559
M3 - 文章
AN - SCOPUS:105042686950
SN - 1545-5971
JO - IEEE Transactions on Dependable and Secure Computing
JF - IEEE Transactions on Dependable and Secure Computing
ER -