Distributed detection in tree topologies with byzantines

Bhavya Kailkhura, Swastik Brahma, Yunghsiang S. Han, Pramod K. Varshney

Research output: Contribution to journalArticle

20 Scopus citations

Abstract

In this paper, we consider the problem of distributed detection in tree topologies in the presence of Byzantines. The expression for minimum attacking power required by the Byzantines to blind the fusion center (FC) is obtained. More specifically, we show that when more than a certain fraction of individual node decisions are falsified, the decision fusion scheme becomes completely incapable. We obtain closed-form expressions for the optimal attacking strategies that minimize the detection error exponent at the FC. We also look at the possible countermeasures from the FC's perspective to protect the network from these Byzantines. We formulate the robust topology design problem as a bi-level program and provide an efficient algorithm to solve it. We also provide some numerical results to gain insights into the solution.

Original languageEnglish (US)
Article number6810176
Pages (from-to)3208-3219
Number of pages12
JournalIEEE Transactions on Signal Processing
Volume62
Issue number12
DOIs
StatePublished - Jun 15 2014

Keywords

  • Bi-level programming
  • Byzantine attacks
  • Kullback-Leibler divergence
  • bounded Knapsack problem
  • distributed detection

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Distributed detection in tree topologies with byzantines'. Together they form a unique fingerprint.

  • Cite this