Energy-efficient quickest change detection in sensor networks

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

Abstract

We propose a minimax formulation for quickest change detection in sensor networks, where there is a cost associated with taking observations at each sensor. We present two energy efficient algorithms, centralized and distributed, in which on-off observation control is employed and the change is detected under a constraint on the false alarm rate. We show that these algorithms are asymptotically optimal as the false alarm rate goes to zero and have good performance compared to the straightforward approach of fractional sampling in which the observations are selected randomly.

Original languageEnglish (US)
Title of host publication2012 IEEE Statistical Signal Processing Workshop, SSP 2012
Pages636-639
Number of pages4
DOIs
StatePublished - Nov 6 2012
Event2012 IEEE Statistical Signal Processing Workshop, SSP 2012 - Ann Arbor, MI, United States
Duration: Aug 5 2012Aug 8 2012

Publication series

Name2012 IEEE Statistical Signal Processing Workshop, SSP 2012

Other

Other2012 IEEE Statistical Signal Processing Workshop, SSP 2012
CountryUnited States
CityAnn Arbor, MI
Period8/5/128/8/12

Keywords

  • Asymptotic Optimality
  • Minimax
  • Observation Control
  • Quickest Change Detection

ASJC Scopus subject areas

  • Signal Processing

Fingerprint Dive into the research topics of 'Energy-efficient quickest change detection in sensor networks'. Together they form a unique fingerprint.

Cite this