Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks

Hsuan Yin Lin, Po Ning Chen*, Yunghsiang S. Han, Pramod K. Varshney

*此作品的通信作者

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

In this work, we consider the general problem of distributed detection in the presence of Byzantines using wireless sensor networks. Instead of attempting to mitigate Byzantine attacks as a system designer, we investigate the issue from the perspective of a Byzantine attacker. The probability for each individual sensor to be compromised (compromising probability) required to blind the system operation is adopted as the attack measure. Under the system setting that the fusion center (FC) declares the most likely hypothesis to be true based on the M-ary data from N local sensors, a Byzantine attack policy that can blind the FC with the minimum compromising probability for each individual sensor is derived under the assumption that the Byzantine attacker knows the statistics of the local outputs. The closed-form expression for a blind-achieving Byzantine transition probability that is used to alter the statistics of the local outputs of compromised sensors is also established. Our results indicate that the statistics of the local outputs is essential for the minimization of an attacker's effort.

原文English
文章編號8952795
頁(從 - 到)647-661
頁數15
期刊IEEE Transactions on Signal Processing
68
DOIs
出版狀態Published - 8 1月 2020

指紋

深入研究「Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks」主題。共同形成了獨特的指紋。

引用此