Abstract
In this chapter, we discuss networked detection problems for several practical network architectures such as parallel, multi-hop, and fully autonomous ad hoc networks. Following the taxonomy presented earlier, fundamental limits of networked inference in the presence of Byzantine attacks are first presented. Next, design of optimal countermeasures using the insights provided by the fundamental limits is discussed from a network designer’s perspective.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
It has been shown that the use of identical thresholds is asymptotically optimal [31].
- 2.
These expressions are valid under the assumption that \(\alpha <0.5\). Later in Sect. 3.1.2, we will discuss a generalization of results for any arbitrary \(\alpha \).
- 3.
Condition \(\alpha < \min \{(0.5-P_f),(1-(m/P_d))\}\), where \(m=\frac{N}{2N-2}>0.5\), suggests that as N tends to infinity, \(m=\dfrac{N}{2N-2}\) tends to 0.5. When \(P_d\) tends to 1 and \(P_f\) tends to 0, the condition \(\alpha < \min \{(0.5-P_f),(1-(m/P_d))\}\) simplifies to \(\alpha <0.5\).
- 4.
Note that \(K^*\) might not be an integer.
- 5.
Minimization is performed over attack strategies \(P_{0,1}\) and \(P_{1,0}\).
- 6.
Note that when \(\alpha >0.5\), all flipping probabilities p which satisfy \(\alpha p=0.5\) will correspond to the best strategy.
- 7.
Node i at level \(k'\) covers all its children at levels \(k'+1\le k\le K\) and the node i itself and, therefore, the total number of covered nodes by \(B_{k'}\), Byzantine at level \(k'\), is \(\dfrac{B_{k'}}{N_{k'}}.\sum _{i=k'}^K N_{i}\).
- 8.
IEEE 802.16j mandates tree forwarding and IEEE 802.11s standardizes a tree-based routing protocol. Note that IEEE 802.16j and IEEE 802.11s are standard protocols for tree-based networks.
- 9.
It was shown in [14] that by minimizing/maximizing the fraction of covered nodes, the FC can maximize/minimize the KLD. Using this fact, the authors considered fraction of covered nodes in lieu of the KLD in their analysis.
- 10.
For a regular tree, intermediate nodes at different levels are allowed to have different degrees, i.e., number of children.
- 11.
In practice, one possible way to achieve this is by using the buffer-less TDMA MAC protocol, in which, distinct non-overlapping time slots are assigned (scheduled) to the nodes for communication. One practical example of such a scheme is given in [29].
- 12.
Note that under the conditional independence assumption, the optimal decision rule at the local sensor is a likelihood-ratio test [32].
- 13.
Node i at level \(k'\) covers (or can alter the decisions of) all its children at levels \(k'+1\) to K and itself. In other words, the total number of covered nodes is equivalent to the total number of corrupted paths (i.e., paths containing a Byzantine node) in the network.
- 14.
In practice, parameters such as threshold \(\lambda \) and consensus time step \(\varepsilon \) are set off-line based on well-known techniques [23].
- 15.
The authors in [18] also come up with a robust distributed weighted average consensus algorithm which allows detection of consensus disruption attacks while mitigating the effect of data falsification attacks.
- 16.
In the equal gain combining scheme, all the nodes (including Byzantines) are given the same weight.
References
Abrardo A, Barni M, Kallas K, Tondi B (2016) A game-theoretic framework for optimum decision fusion in the presence of Byzantines. IEEE Trans Inf Forensics Secur 11(6):1333–1345. https://doi.org/10.1109/TIFS.2016.2526963
Bard JF (1991) Some properties of the bilevel programming problem. J Optim Theory Appl 68(2). https://doi.org/10.1007/BF00941574
Chair Z, Varshney P (1986) Optimal data fusion in multiple sensor detection systems. IEEE Trans Aerosp Electron Syst AES-22(1):98–101
Chen H, Varshney LR, Varshney PK (2014) Noise-enhanced information systems. Proc IEEE 102(10):466–471. https://doi.org/10.1109/TSP.2009.2028938
Deineko VG, Woeginger GJ (2011) A well-solvable special case of the bounded knapsack problem. Oper Res Lett 39:118–120
Digham F, Alouini MS, Simon MK (2003) On the energy detection of unknown signals over fading channels. In: IEEE international conference on communications, 2003. ICC’03, vol 5, pp 3575–3579. https://doi.org/10.1109/ICC.2003.1204119
Gagrani M, Sharma P, Iyengar S, Nadendla VSS, Vempaty A, Chen H, Varshney PK (2011) On noise-enhanced distributed inference in the presence of Byzantines. In: Proceedings of the 49th annual allerton conference on communication, control, and computing, pp 1222–1229. https://doi.org/10.1109/Allerton.2011.6120307
Hashlamoun W, Brahma S, Varshney PK (2018a) Audit bit based distributed Bayesian detection in the presence of Byzantines. https://doi.org/10.1109/TSIPN.2018.2806842
Hashlamoun W, Brahma S, Varshney PK (2018b) Mitigation of Byzantine attacks on distributed detection systems using audit bits. IEEE Trans Signal Inf Process over Nets 4(1):18–32. https://doi.org/10.1109/TSIPN.2017.2723723
Horn RA, Johnson CR (1987) Matrix Analysis. Cambridge University Press, Cambridge, UK
Kailkhura B, Brahma S, Han YS, Varshney PK (2013a) Optimal distributed detection in the presence of Byzantines. In: Proceedings of the 38th international conference on acoustics, speech, and signal processing (ICASSP 2013). Vancouver, Canada
Kailkhura B, Brahma SK, Han YS, Varshney PK (2013b) Optimal distributed detection in the presence of Byzantines. In: Proceedings of the IEEE international conference acoustics, speech, and signal processing (ICASSP 2013), pp 2925–2929. https://doi.org/10.1109/ICASSP.2013.6638193
Kailkhura B, Han YS, Brahma S, Varshney PK (2013c) On covert data falsification attacks on distributed detection systems. In: 2013 13th international symposium on communications and information technologies (ISCIT). IEEE, pp 412–417
Kailkhura B, Brahma S, Han YS, Varshney PK (2014) Distributed detection in tree topologies with Byzantines. IEEE Trans Signal Process 12(62):3208–3219
Kailkhura B, Brahma S, Dulek B, Han YS, Varshney PK (2015a) Distributed detection in tree networks: Byzantines and mitigation techniques. IEEE Trans Inf Forensics Secur 10(7):1499–1512
Kailkhura B, Han YS, Brahma S, Varshney PK (2015b) Asymptotic analysis of distributed bayesian detection with Byzantine data. IEEE Signal Process Lett 22(5):608–612
Kailkhura B, Han YS, Brahma S, Varshney PK (2015c) Distributed bayesian detection in the presence of Byzantine data. IEEE Trans Signal Process 63(19):5250–5263
Kailkhura B, Brahma S, Varshney PK (2017a) Data falsification attacks on consensus-based detection systems. IEEE Trans Signal Inf Process Netw 3(1):145–158
Kailkhura B, Ray P, Rajan D, Yen A, Barnes P, Goldhahn R (2017b) Byzantine-resilient locally optimum detection using collaborative autonomous networks. In: 2017 IEEE 7th international workshop on computational advances in multi-sensor adaptive processing (CAMSAP), pp 1–5. https://doi.org/10.1109/CAMSAP.2017.8313059
Kay SM (1998) Fundamentals of statistical signal processing: detection theory. Prentice hall signal processing series, vol. 2. A. V. Oppenheim, Ed. Prentice Hall PTR
Lin Y, Chen B, Varshney P (2005) Decision fusion rules in multi-hop wireless sensor networks. IEEE Trans Aerosp Electron Syst 41(2):475–488. https://doi.org/10.1109/TAES.2005.1468742
Marano S, Matta V, Tong L (2009) Distributed detection in the presence of Byzantine attacks. IEEE Trans Signal Process 57(1):16–29. https://doi.org/10.1109/TSP.2008.2007335
Olfati-Saber R, Fax J, Murray R (2007) Consensus and cooperation in networked multi-agent systems. Proc IEEE 95(1):215–233
Pasqualetti F, Bicchi A, Bullo F (2012) Consensus computation in unreliable networks: a system theoretic approach. IEEE Trans Autom Control 57(1):90–104
Rawat AS, Anand P, Chen H, Varshney PK (2011) Collaborative spectrum sensing in the presence of Byzantine attacks in cognitive radio networks. IEEE Trans Signal Process 59(2):774–786. https://doi.org/10.1109/TSP.2010.2091277
Shi W, Sun TW, Wesel RD (1999) Optimal binary distributed detection. In: Proceedings of the 33rd asilomar conference on signals, systems, and computers, pp 24–27
Soltanmohammadi E, Naraghi-Pour M (2014a) Fast detection of malicious behavior in cooperative spectrum sensing. IEEE J Sel Areas Commun 32(3):377–386. https://doi.org/10.1109/JSAC.2014.140301
Soltanmohammadi E, Naraghi-Pour M (2014b) Nonparametric density estimation, hypotheses testing, and sensor classification in centralized detection. IEEE Trans Inf Forensics Secur 9(3):426–435. https://doi.org/10.1109/TIFS.2014.2300939
Song WZ, Huang R, Shirazi B, LaHusen R (2009) TreeMAC: Localized TDMA MAC protocol for real-time high-data-rate sensor networks. In: IEEE international conference on pervasive computing and communications, 2009. PerCom 2009, pp 1–10. https://doi.org/10.1109/PERCOM.2009.4912757
Sundaram S, Hadjicostis C (2011) Distributed function calculation via linear iterative strategies in the presence of malicious agents. IEEE Trans Autom Control 56(7):1495–1508. https://doi.org/10.1109/TAC.2010.2088690
Tsitsiklis JN (1988) Decentralized detection by a large number of sensors. Signals Syst Math Control 1(2):167–182
Varshney PK (2012) Distributed detection and data fusion. Springer Science & Business Media
Vempaty A, Agrawal K, Varshney P, Chen H (2011) Adaptive learning of Byzantines’ behavior in cooperative spectrum sensing. In: 2011 IEEE wireless communications and networking conference, pp 1310–1315. https://doi.org/10.1109/WCNC.2011.5779320
Vempaty A, Nadendla VSS, Varshney PK (2013) Further results on noise-enhanced distributed inference in the presence of Byzantines. In: Proceedings of the 16th international symposium wireless personal multmedia communications (WPMC), pp 1–5
Vempaty A, Ray P, Varshney PK (2014) False discovery rate based distributed detection in the presence of Byzantines. IEEE Trans Aerosp Electron Syst 50(3):1826–1840. https://doi.org/10.1109/TAES.2014.120645
Yen AY, Barnes PD, Kailkhura B, Ray P, Rajan D, Schmidt KL, Goldhahn RA (2018) Large-scale parallel simulations of distributed detection algorithms for collaborative autonomous sensor networks. In: Proceedings of the SPIE, pp 1–7. https://doi.org/10.1117/12.2306545
Zhang Q, Varshney P, Wesel R (2002) Optimal bi-level quantization of i.i.d. sensor observations for binary hypothesis testing. IEEE Trans Inf Theory 48(7):2105–2111. https://doi.org/10.1109/TIT.2002.1013153
Zhang W, Wang Z, Guo Y, Liu H, Chen Y, Mitola J (2011) Distributed cooperative spectrum sensing based on weighted average consensus. In: Global telecommunications conference (GLOBECOM 2011), 2011. IEEE, pp 1–6. https://doi.org/10.1109/GLOCOM.2011.6134149
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Vempaty, A., Kailkhura, B., Varshney, P.K. (2018). Distributed Detection with Unreliable Data Sources. In: Secure Networked Inference with Unreliable Data Sources. Springer, Singapore. https://doi.org/10.1007/978-981-13-2312-6_3
Download citation
DOI: https://doi.org/10.1007/978-981-13-2312-6_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2311-9
Online ISBN: 978-981-13-2312-6
eBook Packages: Computer ScienceComputer Science (R0)