Distributed Detection in Tree Topologies With Byzantines

DOI10.1109/TSP.2014.2321735zbMATH Open1394.94748arXiv1309.4513OpenAlexW1940608795MaRDI QIDQ4579270

Swastik Brahma, Yunghsiang Sam Han, P. K. Varshney, Bhavya Kailkhura

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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 counter-measures 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.

Full work available at URL: https://arxiv.org/abs/1309.4513

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13)

Related Items (4)

Distributed Detection in the Presence of Byzantine Attacks ⋮ Distributed Bayesian Detection in the Presence of Byzantine Data ⋮ Byzantine-Resilient Distributed Hypothesis Testing With Time-Varying Network Topology ⋮ Detection Performance of the Majority Dominance Rule in $m$ -Ary Relay Trees With Node and Link Failures

This page was built for publication: Distributed Detection in Tree Topologies With Byzantines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579270)