In this paper, the heterogeneous distributed quickest change detection (HetDQCD) with 1-bit non-anonymous feedback is studied. The concept of syndromes is introduced and the family of syndrome-based fusion rules is proposed, which encompasses all deterministic fusion rules as special cases. Through the Hasse diagram of syndromes, upper and lower bounds on the second-order performance of expected detection delay as a function of average run length to false alarm are provided. An interesting instance, the weighted voting rule previously proposed in our prior work, is then revisited, for which an efficient pruning method for breadth-first search in the Hasse diagram is proposed to analyze the performance. This in turn assists in the design of the weight threshold in the weighted voting rule. Simulation results corroborate that our analysis is instrumental in identifying a proper design for the weighted voting rule, demonstrating consistent superiority over both the anonymous voting rule and the group selection rule in HetDQCD.

翻译：本文研究了具有1比特非匿名反馈的异构分布式快速变化检测问题。引入症状概念并提出基于症状的融合规则族，该规则族将全部确定性融合规则作为特例涵盖。通过症状的哈斯图，给出了以虚警平均运行长度为函数的期望检测延迟二阶性能的上下界。随后重新审视了我们前期工作中提出的加权投票规则这一有趣实例，针对该规则提出了一种在哈斯图中进行广度优先搜索的高效剪枝方法以分析其性能，这进而有助于设计加权投票规则中的权重阈值。仿真结果证实，我们的分析有助于确定加权投票规则的合理设计，在异构分布式快速变化检测中展现出相较于匿名投票规则和分组选择规则的一致优越性。