Decentralized quickest change detection
IEEE Transactions on Information Theory
Information bounds and quickest change detection in decentralized decision systems
IEEE Transactions on Information Theory
Hi-index | 0.00 |
An energy efficient distributed Change Detection scheme based on Page's CUSUM algorithm was presented in [2]. In this paper we consider a nonparametric version of this algorithm. In the algorithm in [2], each sensor runs CUSUM and transmits only when the CUSUM is above some threshold. The transmissions from the sensors are fused at the physical layer. The channel is modeled as a Multiple Access Channel (MAC) corrupted with noise. The fusion center performs another CUSUM to detect the change. In this paper, we generalize the algorithm to also include nonparametric CUSUM and provide a unified analysis.