TY - GEN
T1 - On noise-enhanced distributed inference in the presence of Byzantines
AU - Gagrani, Mukul
AU - Sharma, Pranay
AU - Iyengar, Satish
AU - Nadendla, V. Sriram Siddhardh
AU - Vempaty, Aditya
AU - Chen, Hao
AU - Varshney, Pramod K.
PY - 2011
Y1 - 2011
N2 - This paper considers the noise-enhanced distributed detection problem in the presence of Byzantine (malicious) nodes by suitably adding stochastic resonance (SR) noise. We consider two metrics - the minimum number of Byzantines (α blind) needed to blind the fusion center as a security metric and the Kullback-Leibler divergence (D KL) as a detection performance metric. We show that α blind increases when SR noise is added at the honest nodes. When Byzantines also start adding SR noise to their observations, we see no gain in terms of α blind. However, the detection performance of the network does improve with SR. We also consider a game theoretic formulation where this problem of distributed detection in the presence of Byzantines is modeled as a minimax game between the Byzantines and the inference network, and numerically find Nash equilibria. The case when SR noise is added to the signals received at the fusion center (FC) from the sensors is also considered. Our numerical results indicate that while there is no gain in terms of α blind, the network-wide performance measured in terms of the deflection coefficient does improve in this case.
AB - This paper considers the noise-enhanced distributed detection problem in the presence of Byzantine (malicious) nodes by suitably adding stochastic resonance (SR) noise. We consider two metrics - the minimum number of Byzantines (α blind) needed to blind the fusion center as a security metric and the Kullback-Leibler divergence (D KL) as a detection performance metric. We show that α blind increases when SR noise is added at the honest nodes. When Byzantines also start adding SR noise to their observations, we see no gain in terms of α blind. However, the detection performance of the network does improve with SR. We also consider a game theoretic formulation where this problem of distributed detection in the presence of Byzantines is modeled as a minimax game between the Byzantines and the inference network, and numerically find Nash equilibria. The case when SR noise is added to the signals received at the fusion center (FC) from the sensors is also considered. Our numerical results indicate that while there is no gain in terms of α blind, the network-wide performance measured in terms of the deflection coefficient does improve in this case.
UR - http://www.scopus.com/inward/record.url?scp=84862913450&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84862913450&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2011.6120307
DO - 10.1109/Allerton.2011.6120307
M3 - Conference contribution
AN - SCOPUS:84862913450
SN - 9781457718168
T3 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
SP - 1222
EP - 1229
BT - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
T2 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Y2 - 28 September 2011 through 30 September 2011
ER -