Distributed Detection in Tree Networks: Byzantines and Mitigation Techniques

Creative Commons License

Kailkhura B., Brahma S., DÜLEK B., HAN Y. S., Varshney P. K.

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, vol.10, no.7, pp.1499-1512, 2015 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 10 Issue: 7
  • Publication Date: 2015
  • Doi Number: 10.1109/tifs.2015.2415757
  • Journal Name: IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1499-1512
  • Keywords: Distributed detection, data falsification, Byzantines, tree networks, error exponent, leader-follower game, reputation based mitigation scheme, INFERENCE
  • Hacettepe University Affiliated: Yes

Abstract

In this paper, the problem of distributed detection in tree networks in the presence of Byzantines is considered. Closed form expressions for optimal attacking strategies that minimize the miss detection error exponent at the fusion center (FC) are obtained. We also look at the problem from the network designer's (FC's) perspective. We study the problem of designing optimal distributed detection parameters in a tree network in the presence of Byzantines. Next, we model the strategic interaction between the FC and the attacker as a leader-follower (Stackelberg) game. This formulation provides a methodology for predicting attacker and defender (FC) equilibrium strategies, which can be used to implement the optimal detector. Finally, a reputation-based scheme to identify Byzantines is proposed and its performance is analytically evaluated. We also provide some numerical examples to gain insights into the solution.