A Computationally Efficient Algorithm for Quickest Change Detection in Anonymous Heterogeneous Sensor Networks

The problem of quickest change detection in anonymous heterogeneous sensor networks is studied. The sensors are clustered into K groups, and different groups follow different data generating distributions. At some unknown time, an event occurs in the network and changes the data generating distribut...

Full description

Bibliographic Details

Published in:	2021 IEEE International Symposium on Information Theory (ISIT) pp. 599 - 604
Main Authors:	Sun, Zhongchang, Li, Qunwei, Zhang, Ruizhi, Zou, Shaofeng
Format:	Conference Proceeding
Language:	English
Published:	IEEE 12.07.2021
Subjects:	Approximation algorithms Change detection algorithms Computational efficiency Information theory
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!