匿名异构传感器网络中的快速变化检测
Quickest Change Detection in Anonymous Heterogeneous Sensor Networks
摘要:
研究了匿名异构传感器网络中的最快变化检测(QCD)问题。存在$n$异构传感器和融合中心。传感器被聚类为$K$组,并且不同的组遵循不同的数据生成分布。在某个未知的时间,网络中发生了一个事件,改变了传感器的数据生成分布。我们的目标是尽可能快地检测到变化,受到虚警约束。研究了匿名设置,在每个时间步,融合中心接收到$n$无序样本,融合中心不知道每个样本来自哪个传感器,因而不知道其确切分布。首先为混合似然比检验推导出一个简单的最优性证明,该检验是在(Chen和Wang,2019)中构造的,并被证明对于非顺序匿名设置是最优的。对于QCD问题,进一步构造了一个混合CuSum算法,并进一步证明了该算法在Lorden准则下是最优的。对于大型网络,提出了一种计算效率高的测试,并开发了一种新的理论表征其虚警率。数值结果验证了理论分析的正确性。
英文摘要:
The problem of quickest change detection (QCD) in anonymous heterogeneous sensor networks is studied. There are $n$ heterogeneous sensors and a fusion center. 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 distribution of the sensors. The goal is to detect the change as quickly as possible, subject to false alarm constraints. The anonymous setting is studied, where at each time step, the fusion center receives $n$ unordered samples, and the fusion center does not know which sensor each sample comes from, and thus does not know its exact distribution. A simple optimality proof is first derived for the mixture likelihood ratio test, which was constructed and proved to be optimal for the non-sequential anonymous setting in (Chen and Wang, 2019). For the QCD problem, a mixture CuSum algorithm is further constructed, and is further shown to be optimal under Lorden's criterion. For large networks, a computationally efficient test is proposed and a novel theoretical characterization of its false alarm rate is developed. Numerical results are provided to validate the theoretical results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。