Decentralized data-efficient quickest change detection

Taposh Banerjee, Venugopal V. Veeravalli, Alexander Tartakovsky

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

Abstract

The problem of decentralized quickest change detection is studied with an additional constraint on the cost of observations used at each sensor. Minimax problem formulations are proposed for the problem. A distributed algorithm called the DE-All algorithm is proposed in which on-off observation control is employed locally at each sensor. It is shown that the proposed algorithm is asymptotically optimal up to first order for the proposed formulations.

Original languageEnglish (US)
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages2587-2591
Number of pages5
DOIs
StatePublished - Dec 19 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: Jul 7 2013Jul 12 2013

Publication series

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

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/137/12/13

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Decentralized data-efficient quickest change detection'. Together they form a unique fingerprint.

Cite this