Quickest Change Detection in Adaptive Censoring Sensor Networks

The problem of quickest change detection with communication rate constraints is studied. A network of wireless sensors with limited computation capability monitors the environment and sends observations to a fusion center via wireless channels. At an unknown time instant, the distributions of observ...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on control of network systems Vol. 5; no. 1; pp. 239 - 250
Main Authors: Xiaoqiang Ren, Johansson, Karl H., Dawei Shi, Ling Shi
Format: Journal Article
Language:English
Published: IEEE 01.03.2018
Subjects:
Adaptive
Adaptive systems
asymptotically optimal
censoring
Change detection algorithms
Control systems
CuSum
Delays
minimax
Monitoring
quickest change detection
Wireless communication
Wireless sensor networks
ISSN:2325-5870, 2372-2533
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of quickest change detection with communication rate constraints is studied. A network of wireless sensors with limited computation capability monitors the environment and sends observations to a fusion center via wireless channels. At an unknown time instant, the distributions of observations at all the sensor nodes change simultaneously. Due to limited energy, the sensors cannot transmit at all the time instants. The objective is to detect the change at the fusion center as quickly as possible, subject to constraints on false detection and average communication rate between the sensors and the fusion center. A minimax formulation is proposed. The cumulative sum (CuSum) algorithm is used at the fusion center and censoring strategies are used at the sensor nodes. The censoring strategies, which are adaptive to the CuSum statistic, are fed back by the fusion center. The sensors only send observations that fall into prescribed sets to the fusion center. This CuSum adaptive censoring (CuSum-AC) algorithm is proved to be an equalizer rule and to be globally asymptotically optimal for any positive communication rate constraint, as the average run length to false alarm goes to infinity. It is also shown, by numerical examples, that the CuSum-AC algorithm provides a suitable trade-off between the detection performance and the communication rate.
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2016.2598250