arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1411.0183math.STcs.ITmath.ITmath.PRstat.TH
收藏

传感器网络中数据高效的异常序列最快检测

Data-Efficient Quickest Outlying Sequence Detection in Sensor Networks

Taposh Banerjee, Venugopal V. Veeravalli

AI总结:

针对传感器网络中未知时刻、未知子集传感器的观测分布变化检测问题,提出带多约束的极小极大表述与渐近最优算法,数值验证其性能显著优于传统分数采样方法。

摘要:

本文研究一种传感器网络场景:每个传感器观测一组随机变量序列,每个时间步长内,传感器将观测值的处理版本传输至名为融合中心的公共节点。在某个未知时刻,未知子集的传感器节点的观测分布发生变化。研究目标是在虚警率、各传感器观测成本以及传感器与融合中心间通信成本的约束下,尽可能快地检测出异常序列。针对上述问题,本文提出了极小极大(minimax)表述形式,并设计了相应算法,证明了当虚警率趋近于零时,这些算法对于所提表述具有渐近最优性。数值研究结果表明,所提算法的性能显著优于基于分数采样的算法——后者采用文献中的经典算法,通过使用与观测过程无关的一系列有偏抛硬币结果来满足观测成本约束。

英文摘要:

A sensor network is considered where at each sensor a sequence of random variables is observed. At each time step, a processed version of the observations is transmitted from the sensors to a common node called the fusion center. At some unknown point in time the distribution of observations at an unknown subset of the sensor nodes changes. The objective is to detect the outlying sequences as quickly as possible, subject to constraints on the false alarm rate, the cost of observations taken at each sensor, and the cost of communication between the sensors and the fusion center. Minimax formulations are proposed for the above problem and algorithms are proposed that are shown to be asymptotically optimal for the proposed formulations, as the false alarm rate goes to zero. It is also shown, via numerical studies, that the proposed algorithms perform significantly better than those based on fractional sampling, in which the classical algorithms from the literature are used and the constraint on the cost of observations is met by using the outcome of a sequence of biased coin tosses, independent of the observation process.

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

↑