Skip to main navigation Skip to search Skip to main content

A Computationally Efficient Algorithm for Quickest Change Detection in Anonymous Heterogeneous Sensor Networks

  • Zhongchang Sun
  • , Qunwei Li
  • , Ruizhi Zhang
  • , Shaofeng Zou
  • SUNY Buffalo
  • Ant Financial
  • University of Nebraska-Lincoln

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The problem of quickest change detection in anonymous heterogeneous sensor networks is studied. The sensors are clustered into K groups, and different groups follow different data generating distributions. At some unknown time, an event occurs in the network and changes the data generating distribution of the sensors. The goal is to detect the change as quickly as possible, subject to false alarm constraints. The anonymous setting is studied, where at each time step, the fusion center receives unordered samples without knowing which sensor each sample comes from, and thus does not know its exact distribution. In [1], an optimal algorithm was provided, which however is not computational efficient for large networks. In this paper, a computationally efficient test is proposed and a novel theoretical characterization of its false alarm rate is further developed.

Original languageEnglish
Title of host publication2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages599-604
Number of pages6
ISBN (Electronic)9781538682098
DOIs
StatePublished - Jul 12 2021
Event2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia
Duration: Jul 12 2021Jul 20 2021

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2021-July
ISSN (Print)2157-8095

Conference

Conference2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/TerritoryAustralia
CityVirtual, Melbourne
Period07/12/2107/20/21

Fingerprint

Dive into the research topics of 'A Computationally Efficient Algorithm for Quickest Change Detection in Anonymous Heterogeneous Sensor Networks'. Together they form a unique fingerprint.

Cite this