Distributed detection over connected networks via one-bit quantizer

Shengyu Zhu, Biao Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper considers distributed detection over large scale connected networks with arbitrary topology. Contrasting to the canonical parallel fusion network where a single node has access to the outputs from all other sensors, each node can only exchange one-bit information with its direct neighbors in the present setting. Our approach adopts a novel consensus reaching algorithm using asymmetric bounded quantizers that allow controllable consensus error. Under the Neyman-Pearson criterion, we show that, with each sensor employing an identical one-bit quantizer for local information exchange, this approach achieves the optimal error exponent of centralized detection provided that the algorithm converges. Simulations show that the algorithm converges when the network is large enough.

Original languageEnglish (US)
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1526-1530
Number of pages5
Volume2016-August
ISBN (Electronic)9781509018062
DOIs
StatePublished - Aug 10 2016
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: Jul 10 2016Jul 15 2016

Other

Other2016 IEEE International Symposium on Information Theory, ISIT 2016
CountrySpain
CityBarcelona
Period7/10/167/15/16

Fingerprint

Error Exponent
Converge
Sensor
Vertex of a graph
Sensor nodes
Fusion
Fusion reactions
Topology
Output
Sensors
Arbitrary
Simulation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Zhu, S., & Chen, B. (2016). Distributed detection over connected networks via one-bit quantizer. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (Vol. 2016-August, pp. 1526-1530). [7541554] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541554

Distributed detection over connected networks via one-bit quantizer. / Zhu, Shengyu; Chen, Biao.

Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016. p. 1526-1530 7541554.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhu, S & Chen, B 2016, Distributed detection over connected networks via one-bit quantizer. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. vol. 2016-August, 7541554, Institute of Electrical and Electronics Engineers Inc., pp. 1526-1530, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 7/10/16. https://doi.org/10.1109/ISIT.2016.7541554
Zhu S, Chen B. Distributed detection over connected networks via one-bit quantizer. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1526-1530. 7541554 https://doi.org/10.1109/ISIT.2016.7541554
Zhu, Shengyu ; Chen, Biao. / Distributed detection over connected networks via one-bit quantizer. Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Vol. 2016-August Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1526-1530
@inproceedings{deee07a10b6a49fe9c8717da4de77f2f,
title = "Distributed detection over connected networks via one-bit quantizer",
abstract = "This paper considers distributed detection over large scale connected networks with arbitrary topology. Contrasting to the canonical parallel fusion network where a single node has access to the outputs from all other sensors, each node can only exchange one-bit information with its direct neighbors in the present setting. Our approach adopts a novel consensus reaching algorithm using asymmetric bounded quantizers that allow controllable consensus error. Under the Neyman-Pearson criterion, we show that, with each sensor employing an identical one-bit quantizer for local information exchange, this approach achieves the optimal error exponent of centralized detection provided that the algorithm converges. Simulations show that the algorithm converges when the network is large enough.",
author = "Shengyu Zhu and Biao Chen",
year = "2016",
month = "8",
day = "10",
doi = "10.1109/ISIT.2016.7541554",
language = "English (US)",
volume = "2016-August",
pages = "1526--1530",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Distributed detection over connected networks via one-bit quantizer

AU - Zhu, Shengyu

AU - Chen, Biao

PY - 2016/8/10

Y1 - 2016/8/10

N2 - This paper considers distributed detection over large scale connected networks with arbitrary topology. Contrasting to the canonical parallel fusion network where a single node has access to the outputs from all other sensors, each node can only exchange one-bit information with its direct neighbors in the present setting. Our approach adopts a novel consensus reaching algorithm using asymmetric bounded quantizers that allow controllable consensus error. Under the Neyman-Pearson criterion, we show that, with each sensor employing an identical one-bit quantizer for local information exchange, this approach achieves the optimal error exponent of centralized detection provided that the algorithm converges. Simulations show that the algorithm converges when the network is large enough.

AB - This paper considers distributed detection over large scale connected networks with arbitrary topology. Contrasting to the canonical parallel fusion network where a single node has access to the outputs from all other sensors, each node can only exchange one-bit information with its direct neighbors in the present setting. Our approach adopts a novel consensus reaching algorithm using asymmetric bounded quantizers that allow controllable consensus error. Under the Neyman-Pearson criterion, we show that, with each sensor employing an identical one-bit quantizer for local information exchange, this approach achieves the optimal error exponent of centralized detection provided that the algorithm converges. Simulations show that the algorithm converges when the network is large enough.

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

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

U2 - 10.1109/ISIT.2016.7541554

DO - 10.1109/ISIT.2016.7541554

M3 - Conference contribution

AN - SCOPUS:84985920129

VL - 2016-August

SP - 1526

EP - 1530

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

ER -