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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2021 IEEE International Symposium on Information Theory (ISIT) S. 599 - 604
Hauptverfasser:	Sun, Zhongchang, Li, Qunwei, Zhang, Ruizhi, Zou, Shaofeng
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 12.07.2021
Schlagworte:	Approximation algorithms Change detection algorithms Computational efficiency Information theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!