异构传感器网络中带宽受限的分布式快速变化检测：匿名与非匿名设置
Bandwidth-Constrained Distributed Quickest Change Detection in Heterogeneous Sensor Networks: Anonymous vs Non-Anonymous Settings
AI总结：
研究异构传感器网络中带宽受限的分布式快速变化检测，提出加权投票规则，优于匿名方案，揭示匿名代价。
摘要：
研究了具有1比特反馈的异构分布式快速变化检测（HetDQCD）问题，其中融合中心通过一组异构传感器以匿名1比特反馈的方式监测一个突变。考虑了两种融合规则：一次性规则和投票规则。我们分析了这两种规则在最坏情况下的预期检测延迟和平均误报运行长度方面的性能。我们的分析揭示了让更多传感器参与决策的混合影响，并使我们能够在这两种方案中找到接近最优的参数选择。值得注意的是，与同构设置相比，首次报警规则在一次性方案中可能不再带来最佳性能。随后研究了非匿名设置，提出了一种新颖的加权投票规则，该规则为不同类型传感器的投票分配不同的权重。仿真结果表明，所提出的方案能够优于上述所有方案以及用于匿名HetDQCD的混合CUSUM方案，这暗示了匿名的代价。
英文摘要：
The heterogeneous distributed quickest change detection (HetDQCD) problem with 1-bit feedback is studied, in which a fusion center monitors an abrupt change through a bunch of heterogeneous sensors via anonymous 1-bit feedbacks. Two fusion rules, one-shot and voting rules, are considered. We analyze the performance in terms of the worst-case expected detection delay and the average run length to false alarm for the two fusion rules. Our analysis unveils the mixed impact of involving more sensors into the decision and enables us to find near optimal choices of parameters in the two schemes. Notably, it is shown that, in contrast to the homogeneous setting, the first alarm rule may no longer lead to the best performance among one-shot schemes. The non-anonymous setting is then investigated where a novel weighted voting rule is proposed that assigns different weights to votes from different types of sensors. Simulation results show that the proposed scheme is able to outperform all the above schemes and the mixture CUSUM scheme for the anonymous HetDQCD, hinting at the price of anonymity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
