arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1105.6061stat.APcs.ITcs.NImath.IT
收藏

大范围无线传感器网络中最快事件检测的分布式检测/隔离过程

Distributed Detection/Isolation Procedures for Quickest Event Detection in Large Extent Wireless Sensor Networks

Premkumar Karumbu, Anurag Kumar, Joy Kuri

摘要:

研究了大范围无线传感器网络($\wsn$)中的一个固定点事件的分布式检测问题,该事件只影响其附近传感器的观测值.事件发生在$\wsn$的覆盖区域(或感兴趣区域($\ROI$))中的未知时间和随机位置。我们考虑一个一般的传感模型,其中事件在传感器节点的影响取决于事件和传感器节点之间的距离;特别是,在布尔传感模型中,在事件周围的给定半径的磁盘中的所有传感器同样受到影响。在\cite{nikiforov95change_isolation}、\cite{nikiforov03lower-bound-for-det-isolation}、\cite{tartakovsky08multi-decision}、{ \em}中报告的先前工作之后,将问题公式化为在以下约束下尽可能早地检测事件并将其定位到$\ROI$的子区域的问题:($\tfa$)由$γ$下界,并且假分离的概率($\pfi$)以$α$ }为上界,其中$γ$和$α$是目标性能要求。在这种情况下,我们提出了分布式程序的事件检测和隔离(即$\mx$,$\all$和$\hall$),基于本地融合的$\CUSUM$ s在传感器。对于这些程序,我们得到的最大平均检测/隔离延迟($\add$),$\tfa$和$\pfi$上的界限,从而提供了一个上限$\add$为$\min\{γ,1/α\} \to \infty$。对于布尔传感模型,我们表明,我们的分布式程序的规模与$γ$和$α$的最大平均检测/隔离延迟的渐近上限以同样的方式作为渐近最优的集中式程序\cite{nikiforov03lower-bound-for-det-isolation}。

英文摘要:

We study a problem of distributed detection of a stationary point event in a large extent wireless sensor network ($\wsn$), where the event influences the observations of the sensors only in the vicinity of where it occurs. An event occurs at an unknown time and at a random location in the coverage region (or region of interest ($\ROI$)) of the $\wsn$. We consider a general sensing model in which the effect of the event at a sensor node depends on the distance between the event and the sensor node; in particular, in the Boolean sensing model, all sensors in a disk of a given radius around the event are equally affected. Following the prior work reported in \cite{nikiforov95change_isolation}, \cite{nikiforov03lower-bound-for-det-isolation}, \cite{tartakovsky08multi-decision}, {\em the problem is formulated as that of detecting the event and locating it to a subregion of the $\ROI$ as early as possible under the constraints that the average run length to false alarm ($\tfa$) is bounded below by $γ$, and the probability of false isolation ($\pfi$) is bounded above by $α$}, where $γ$ and $α$ are target performance requirements. In this setting, we propose distributed procedures for event detection and isolation (namely $\mx$, $\all$, and $\hall$), based on the local fusion of $\CUSUM$s at the sensors. For these procedures, we obtain bounds on the maximum mean detection/isolation delay ($\add$), and on $\tfa$ and $\pfi$, and thus provide an upper bound on $\add$ as $\min\{γ,1/α\} \to \infty$. For the Boolean sensing model, we show that an asymptotic upper bound on the maximum mean detection/isolation delay of our distributed procedure scales with $γ$ and $α$ in the same way as the asymptotically optimal centralised procedure \cite{nikiforov03lower-bound-for-det-isolation}.

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

↑