Distributed Detection in Ad Hoc Networks Through Quantized Consensus

Shengyu Zhu, Biao Chen

Research output: Contribution to journalArticle

Abstract

We study the 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: 1) the Bayesian criterion where the maximum a posteriori detector is optimal; 2) the Neyman-Pearson criterion with a constant type-I error probability constraint; and 3) 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 a 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 the 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.

Original languageEnglish (US)
Article number8434248
Pages (from-to)7017-7030
Number of pages14
JournalIEEE Transactions on Information Theory
Volume64
Issue number11
DOIs
StatePublished - Nov 1 2018

Fingerprint

Ad hoc networks
information exchange
performance
Sensor networks
Detectors
continuity
Error probability
present

Keywords

  • Distributed detection
  • error exponent
  • large deviations
  • one-bit quantizer
  • quantized consensus

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Distributed Detection in Ad Hoc Networks Through Quantized Consensus. / Zhu, Shengyu; Chen, Biao.

In: IEEE Transactions on Information Theory, Vol. 64, No. 11, 8434248, 01.11.2018, p. 7017-7030.

Research output: Contribution to journalArticle

@article{2d75ed648e3347faaba1971ec25a272a,
title = "Distributed Detection in Ad Hoc Networks Through Quantized Consensus",
abstract = "We study the 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: 1) the Bayesian criterion where the maximum a posteriori detector is optimal; 2) the Neyman-Pearson criterion with a constant type-I error probability constraint; and 3) 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 a 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 the 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.",
keywords = "Distributed detection, error exponent, large deviations, one-bit quantizer, quantized consensus",
author = "Shengyu Zhu and Biao Chen",
year = "2018",
month = "11",
day = "1",
doi = "10.1109/TIT.2018.2865108",
language = "English (US)",
volume = "64",
pages = "7017--7030",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Distributed Detection in Ad Hoc Networks Through Quantized Consensus

AU - Zhu, Shengyu

AU - Chen, Biao

PY - 2018/11/1

Y1 - 2018/11/1

N2 - We study the 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: 1) the Bayesian criterion where the maximum a posteriori detector is optimal; 2) the Neyman-Pearson criterion with a constant type-I error probability constraint; and 3) 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 a 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 the 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.

AB - We study the 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: 1) the Bayesian criterion where the maximum a posteriori detector is optimal; 2) the Neyman-Pearson criterion with a constant type-I error probability constraint; and 3) 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 a 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 the 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.

KW - Distributed detection

KW - error exponent

KW - large deviations

KW - one-bit quantizer

KW - quantized consensus

UR - http://www.scopus.com/inward/record.url?scp=85051649343&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85051649343&partnerID=8YFLogxK

U2 - 10.1109/TIT.2018.2865108

DO - 10.1109/TIT.2018.2865108

M3 - Article

VL - 64

SP - 7017

EP - 7030

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 11

M1 - 8434248

ER -