基于不可靠传感器的局部事件边界检测:多数投票方案分析
Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme
摘要:
在本文中,我们研究了在一个较大的区域$Y$内的事件区域$X$的识别,其中传感器由密度为$λ$的泊松过程分布以检测该事件区域,即,它的边界。传感器的模型是一个0-1传感器,它决定它是否位于$X$中,并且可能以$p$的概率不正确。它还收集关于在一定距离$r$内的邻居的0-1值的信息,并通过这些邻居的多数投票来修改其决定。在最一般的设置,我们分析了这个简单的多数表决方案,并得出一些上界和下界的预期数量的误分类传感器。这些界限取决于$p$、$r$的几个感测参数以及事件区域$X$的一些几何参数。通过对$X$的形状作一些假设,我们证明了一个显着改善的上限上的预期数量的误分类传感器,特别是凸区域具有足够圆的边界,我们发现,多数表决方案在模拟中表现良好,而不是其理论上限。
英文摘要:
In this paper we study the identification of an event region $X$ within a larger region $Y$, in which the sensors are distributed by a Poisson process of density $λ$ to detect this event region, i.e., its boundary. The model of sensor is a 0-1 sensor that decides whether it lies in $X$ or not, and which might be incorrect with probability $p$. It also collects information on the 0-1 values of the neighbors within some distance $r$ and revises its decision by the majority vote of these neighbors. In the most general setting, we analyze this simple majority vote scheme and derive some upper and lower bounds on the expected number of misclassified sensors. These bounds depend on several sensing parameters of $p$, $r$, and some geometric parameters of the event region $X$. By making some assumptions on the shape of $X$, we prove a significantly improved upper bound on the expected number of misclassified sensors; especially for convex regions with sufficiently round boundary, and we find that the majority vote scheme performs well in the simulation rather than its theoretical upper bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。