Distributed Detection in Ad Hoc Networks Through Quantized Consensus

DOI10.1109/TIT.2018.2865108zbMATH Open1431.94029arXiv1612.01904OpenAlexW3102249197WikidataQ129408636 ScholiaQ129408636MaRDI QIDQ4559575FDOQ4559575

Authors: Shengyu Zhu, Biao Chen 

Publication date: 4 December 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study asymptotic performance of distributed detection in large scale connected sensor networks. Contrasting to the canonical parallel network where a single node has access to local decisions from all other nodes, each node can only exchange information with its direct neighbors in the present setting. We establish that, with each node employing an identical one-bit quantizer for local information exchange, a novel consensus reaching approach can achieve the optimal asymptotic performance of centralized detection as the network size scales. The statement is true under three different detection frameworks: the Bayesian criterion where the maximum a posteriori detector is optimal, the Neyman-Pearson criterion with a constant type-I error probability constraint, and the Neyman-Pearson criterion with an exponential type-I error probability constraint. Leveraging recent development in distributed consensus reaching using bounded quantizers with possibly unbounded data (which are log-likelihood ratios of local observations in the context of distributed detection), we design a one-bit deterministic quantizer with controllable threshold that leads to desirable consensus error bounds. The obtained bounds are key to establishing the optimal asymptotic detection performance. In addition, we examine non-asymptotic performance of the proposed approach, and show that the type-I and type-II error probabilities at each node can be made arbitrarily close to the centralized ones simultaneously when a continuity condition is satisfied.

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Quantum measurement theory, state operations, state preparations (81P15)

Cited In (8)

• The decentralized quickest detection problem
• An algorithm for determining the decision thresholds in a distributed detection problem
• Diffusion-Based Adaptive Distributed Detection: Steady-State Performance in the Slow Adaptation Regime
• Optimal Distributed Detection in Clustered Wireless Sensor Networks
• Distributed change detection via average consensus over networks
• Distributed Detection in the Presence of Byzantine Attacks
• Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links
• Detection of Sparse Stochastic Signals With Quantized Measurements in Sensor Networks

This page was built for publication: Distributed Detection in Ad Hoc Networks Through Quantized Consensus

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