|| Quickest Dynamic Anomaly Detection in Anonymous Heterogeneous Sensor Networks
||Zhongchang Sun, Shaofeng Zou, University at Buffalo, the State University of New York, United States|
||D1-S2-T3: Quickest Change Detection
||Monday, 12 July, 22:20 - 22:40
||Monday, 12 July, 22:40 - 23:00
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. The problem of quickest dynamic anomaly detection in anonymous heterogeneous sensor networks is studied. The n heterogeneous sensors can be divided into K types with different data generating distributions. At some unknown time, an anomaly emerges in the network and changes the data generating distribution of the sensors. The goal is to detect the anomaly as quickly as possible, subject to false alarm constraints. The anonymous setting is studied, where the fusion center does not know which sensor that each sample comes from, and thus does not know its exact distribution. Firstly, the static setting is investigated where the sensor affected by the anomaly does not change with time. A generalized mixture CuSum algorithm is constructed and is further shown to be asymptotically optimal. The problem is then extended to a dynamic setting where the sensor affected by the anomaly changes with time. An asymptotically optimal weighted mixture CuSum algorithm is proposed. Numerical results are also provided to validate the theoretical results.