arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.08357eess.SYcs.SY
收藏

用于对抗多传感器网络决策融合的消息传递方法

A Message Passing Approach for Decision Fusion in Adversarial Multi-Sensor Networks

Department of Information Engineering and Mathematics(信息与数学工程系)

Andrea Abrardo, Mauro Barni, Kassem Kallas, Benedetta Tondi

AI总结:

本文提出基于消息传递的近优算法,降低最优融合规则的计算复杂度,同时在依赖系统状态情况下保持良好性能,通过仿真验证其在长观察窗口下的优越性。

摘要:

我们考虑一个简单但广泛研究的设置,在其中融合中心(FC)需根据可能被篡改的决策做出二元决策,即拜占庭节点故意改变局部决策以在融合中心引入错误。当考虑独立状态时,批量观测的最优融合规则已推导,但其复杂度限制了其在大观测窗口中的应用。本文提出一种基于消息传递的近优算法,显著降低最优融合规则的计算负担。此外,该算法在依赖系统状态情况下也表现良好。通过首先关注小观测窗口的情况,利用数值模拟表明所提方案相比最优融合规则引入的决策错误概率可忽略不计。然后分析FC在长观测窗口下决策时的性能,考虑独立和马尔可夫系统状态情况,证明所获性能优于先前次优方案。此外,确认先前发现,在某些情况下,拜占庭节点最小化系统状态序列与提交给FC的报告之间的互信息比始终翻转局部决策更优。

英文摘要:

We consider a simple, yet widely studied, set-up in which a Fusion Center (FC) is asked to make a binary decision about a sequence of system states by relying on the possibly corrupted decisions provided by byzantine nodes, i.e. nodes which deliberately alter the result of the local decision to induce an error at the fusion center. When independent states are considered, the optimum fusion rule over a batch of observations has already been derived, however its complexity prevents its use in conjunction with large observation windows. In this paper, we propose a near-optimal algorithm based on message passing that greatly reduces the computational burden of the optimum fusion rule. In addition, the proposed algorithm retains very good performance also in the case of dependent system states. By first focusing on the case of small observation windows, we use numerical simulations to show that the proposed scheme introduces a negligible increase of the decision error probability compared to the optimum fusion rule. We then analyse the performance of the new scheme when the FC make its decision by relying on long observation windows. We do so by considering both the case of independent and Markovian system states and show that the obtained performance are superior to those obtained with prior suboptimal schemes. As an additional result, we confirm the previous finding that, in some cases, it is preferable for the byzantine nodes to minimise the mutual information between the sequence system states and the reports submitted to the FC, rather than always flipping the local decision.

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

↑