pith. sign in

arxiv: 1710.10378 · v3 · pith:K26DKNEEnew · submitted 2017-10-28 · 📡 eess.SP · cs.IT· cs.SY· math.IT

Distributed Change Detection via Average Consensus over Networks

classification 📡 eess.SP cs.ITcs.SYmath.IT
keywords distributedconsensusdetectionperformancealgorithmaverageschemestatistic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.