On the performance analysis of data fusion schemes with Byzantines

This paper considers the problem of performance analysis of data fusion schemes in the presence of Byzantine attacks. First, we analyze the security performance of data fusion schemes with Byzantines. We show that when more than a certain fraction of Byzantines are present in the network, the raw data fusion schemes become completely incapable (blind). More specifically, we obtain a closed form expression for the lower bound on the fraction of Byzantines needed to blind the fusion center as a function of attacker´s strength. Next, we investigate the global detection performance in the presence of Byzantine attacks, and analytically characterize the effect of Byzantines on detection performance. Numerical results provide insights into our analysis.