arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0808.0291cs.ITmath.IT
收藏

分散式最快变化检测的一次方案

One shot schemes for decentralized quickest change detection

Olympia Hadjiliadis, Hongzhong Zhang, H. V. Poor

摘要:

这项工作考虑了N个分布式传感器,从环境中接收连续的顺序观测的最快检测的问题。这些传感器采用累积和(CSCUM)策略,并通过一次性方案与中央融合中心进行通信。单触发方案是传感器仅与融合中心通信一次的方案,之后它们必须发出检测信号。通信显然是异步的,并考虑融合中心采用最小策略的情况,这意味着当第一次通信发生时,它会发出警报。假设在传感器处接收到的观测是独立的,并且信号出现的时间点是不同的。结果表明,有没有损失的性能相比,集中式的情况下,在扩展的Lorden最小-最大意义上的一次拍摄计划,因为最小的N个NMEUMS是渐近最优的平均时间之间的虚警增加没有约束。

英文摘要:

This work considers the problem of quickest detection with N distributed sensors that receive continuous sequential observations from the environment. These sensors employ cumulative sum (CUSUM) strategies and communicate to a central fusion center by one shot schemes. One shot schemes are schemes in which the sensors communicate with the fusion center only once, after which they must signal a detection. The communication is clearly asynchronous and the case is considered in which the fusion center employs a minimal strategy, which means that it declares an alarm when the first communication takes place. It is assumed that the observations received at the sensors are independent and that the time points at which the appearance of a signal can take place are different. It is shown that there is no loss of performance of one shot schemes as compared to the centralized case in an extended Lorden min-max sense, since the minimum of N CUSUMs is asymptotically optimal as the mean time between false alarms increases without bound.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑