Distributed Detection in Tree Topologies with Byzantines
Preprint
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.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Distributed Inference with Byzantine Data: State-of-the-Art Review on Data Falsification AttacksIEEE Signal Processing Magazine, 2013
- Decentralized Hypothesis Testing in Wireless Sensor Networks in the Presence of Misbehaving NodesIEEE Transactions on Information Forensics and Security, 2012
- A Survey on Security Threats and Detection Techniques in Cognitive Radio NetworksIEEE Communications Surveys & Tutorials, 2012
- Review of Robust Cooperative Spectrum Sensing Techniques for Cognitive Radio NetworksWireless Personal Communications, 2011
- A well-solvable special case of the bounded knapsack problemOperations Research Letters, 2011
- Distributed Detection in the Presence of Byzantine AttacksIEEE Transactions on Signal Processing, 2008
- Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial ReuseIEEE Transactions on Information Theory, 2007
- Decision fusion rules in multi-hop wireless sensor networksIEEE Transactions on Aerospace and Electronic Systems, 2005
- Distributed detection with multiple sensors I. FundamentalsProceedings of the IEEE, 1997
- Some properties of the bilevel programming problemJournal of Optimization Theory and Applications, 1991