Optimal Byzantine attacks on distributed detection in tree-based topologies

Bhavya Kailkhura, Swastik Brahma, Pramod K. Varshney

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Scopus citations

Abstract

This paper considers the problem of optimal Byzantine attacks or data falsification attacks on distributed detection mechanism in tree-based topologies. First, we show that when more than a certain fraction of individual node decisions are falsified, the decision fusion scheme becomes completely incapable. Second, under the assumption that there is a cost associated with attacking each node (which represent resources invested in capturing a node or cloning a node in some cases), we address the problem of minimum cost Byzantine attacks and formulate it as the bounded knapsack problem (BKP). An algorithm to solve our problem in polynomial time is presented. Numerical results provide insights into our solution.

Original languageEnglish (US)
Title of host publication2013 International Conference on Computing, Networking and Communications, ICNC 2013
Pages227-231
Number of pages5
DOIs
StatePublished - May 15 2013
Event2013 International Conference on Computing, Networking and Communications, ICNC 2013 - San Diego, CA, United States
Duration: Jan 28 2013Jan 31 2013

Publication series

Name2013 International Conference on Computing, Networking and Communications, ICNC 2013

Other

Other2013 International Conference on Computing, Networking and Communications, ICNC 2013
CountryUnited States
CitySan Diego, CA
Period1/28/131/31/13

Keywords

  • Bounded Knapsack Problem
  • Byzantine Attacks
  • Distributed Detection
  • Tree Topologies

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Fingerprint Dive into the research topics of 'Optimal Byzantine attacks on distributed detection in tree-based topologies'. Together they form a unique fingerprint.

  • Cite this

    Kailkhura, B., Brahma, S., & Varshney, P. K. (2013). Optimal Byzantine attacks on distributed detection in tree-based topologies. In 2013 International Conference on Computing, Networking and Communications, ICNC 2013 (pp. 227-231). [6504085] (2013 International Conference on Computing, Networking and Communications, ICNC 2013). https://doi.org/10.1109/ICCNC.2013.6504085