Distributed Inference With M-Ary Quantized Data in the Presence of Byzantine Attacks
Authors:
- 26 March 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 62 (10) , 2681-2695
Abstract
The problem of distributed inference with M-ary quantized data at the sensors is investigated in the presence of Byzantine attacks. We assume that the Byzantine nodes attack the inference network by modifying the symbol corresponding to the quantized data to one of the other symbols in the quantization alphabet-set and transmitting falsified symbol to the fusion center (FC). In this paper, we find the optimal Byzantine attack that blinds any distributed inference network. As the quantization alphabet size increases, a tremendous improvement in the security performance of the distributed inference network is observed. In addition to the perfect channel case, in Appendix A , we also analyze the optimal Byzantine attack when the channel between the nodes and the FC is noisy and is modelled as a discrete M-ary channel. We also investigate the optimal attack within the restricted space of highly-symmetric attack strategies, that maximally degrades the performance of the inference network in the presence of resource-constrained Byzantine attacks. A reputation-based scheme for identifying malicious nodes is also presented as the network's strategy to mitigate the impact of Byzantine threats on the inference performance of the distributed sensor network. We also provide asymptotic analysis to find the optimal reputation-based scheme as a function of the fraction of compromised nodes in the network.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Distributed inference in wireless sensor networksPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2012
- Distributed Detection in the Presence of Byzantine AttacksIEEE Transactions on Signal Processing, 2008
- Bandwidth-constrained distributed estimation for wireless sensor Networks-part I: Gaussian caseIEEE Transactions on Signal Processing, 2006
- Locating the nodes: cooperative localization in wireless sensor networksIEEE Signal Processing Magazine, 2005
- TinySec2004
- Security in wireless sensor networksCommunications of the ACM, 2004
- Distributed target classification and tracking in sensor networksProceedings of the IEEE, 2003
- SPINS: Security Protocols for Sensor NetworksWireless Networks, 2002
- Decentralized detection by a large number of sensorsMathematics of Control, Signals, and Systems, 1988
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982