Distributed Change Detection via Average Consensus over Networks
Qinghua Liu, Rui Zhang, Yao Xie

TL;DR
This paper introduces a distributed change detection algorithm using average consensus in sensor networks, which matches centralized performance and effectively detects asynchronous changes in real-time.
Contribution
It proposes a novel distributed detection method based on local CUSUM statistics and consensus, with theoretical performance guarantees and practical effectiveness.
Findings
Performance bounds match centralized algorithms under mild conditions.
Effective detection of asynchronous changes demonstrated.
Algorithm performs well in numerical experiments.
Abstract
Distributed change-point detection has been a fundamental problem when performing real-time monitoring using sensor-networks. We propose a distributed detection algorithm, where each sensor only exchanges CUSUM statistic with their neighbors based on the average consensus scheme, and an alarm is raised when local consensus statistic exceeds a pre-specified global threshold. We provide theoretical performance bounds showing that the performance of the fully distributed scheme can match the centralized algorithms under some mild conditions. Numerical experiments demonstrate the good performance of the algorithm especially in detecting asynchronous changes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Statistical Process Monitoring · Distributed Sensor Networks and Detection Algorithms · Fault Detection and Control Systems
