Distributed Detection in Tree Networks: Byzantines and Mitigation Techniques

Bhavya Kailkhura, Swastik Brahma, Berkan Dulek, Yunghsiang S. Han, Pramod Kumar Varshney

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

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.

Original languageEnglish (US)
Article number7065266
Pages (from-to)1499-1512
Number of pages14
JournalIEEE Transactions on Information Forensics and Security
Volume10
Issue number7
DOIs
StatePublished - Jul 1 2015

Keywords

  • Byzantines
  • data falsification
  • Distributed detection
  • error exponent
  • leader-follower game
  • reputation based mitigation scheme
  • tree networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Distributed Detection in Tree Networks: Byzantines and Mitigation Techniques'. Together they form a unique fingerprint.

Cite this