arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.07212cs.CReess.SP
收藏

拜占庭攻击下基于信誉和审计比特的分布式检测

Reputation and Audit Bit Based Distributed Detection in the Presence of Byzantine

Chen Quan, Yunghsiang S. Han, Baocheng Geng, Pramod K. Varshney

摘要:

针对分布式检测网络中,当融合中心(FC)不知道拜占庭节点的攻击策略时,提出了两种基于信誉的算法:基于信誉和审计的聚类(RAC)算法和基于信誉和审计的辅助锚节点聚类(RACA)算法.通过更新簇网络中节点的信誉指数,系统能够准确识别拜占庭节点。仿真结果表明,与其他算法相比,这两种算法具有更好的检测性能。所提出的RACA算法工作良好,即使当拜占庭节点的数量超过网络中的传感器总数的一半。此外,我们提出的算法的鲁棒性进行评估,在一个动态变化的情况下,攻击参数随时间变化。我们表明,我们的算法仍然可以实现优越的检测性能。

英文摘要:

In this paper, two reputation based algorithms called Reputation and audit based clustering (RAC) algorithm and Reputation and audit based clustering with auxiliary anchor node (RACA) algorithm are proposed to defend against Byzantine attacks in distributed detection networks when the fusion center (FC) has no prior knowledge of the attacking strategy of Byzantine nodes. By updating the reputation index of the sensors in cluster-based networks, the system can accurately identify Byzantine nodes. The simulation results show that both proposed algorithms have superior detection performance compared with other algorithms. The proposed RACA algorithm works well even when the number of Byzantine nodes exceeds half of the total number of sensors in the network. Furthermore, the robustness of our proposed algorithms is evaluated in a dynamically changing scenario, where the attacking parameters change over time. We show that our algorithms can still achieve superior detection performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑