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

基于二元接近传感器的目标可分性研究

On the Separability of Targets Using Binary Proximity Sensors

B. Santhana Krishnan, Animesh Kumar, D. Manjunath, Bikash K. Dey

摘要:

我们考虑的问题,其中的传感器网络必须检测到目标的存在,在任何$n$可能的位置在一个有限的区域。所有这些位置可能不会被目标占据。来自传感器的数据被融合以确定具有目标的位置集合。我们称之为可分性问题。在本文中,我们解决了分离的渐近大量的静态目标位置,通过使用二进制接近传感器。两个模型的目标位置被认为是:(i)当目标位置位于均匀间隔的网格;和(ii)当目标位置是独立同分布。均匀分布在该地区。传感器位置独立同分布在同一有限区域内,与目标位置无关。我们推导出的传感半径和传感器的数量,以实现可分性的条件。顺序最优的缩放定律,传感器的数量作为目标位置的数量的函数,推导出两种类型的可分性要求。还解决了上述问题的鲁棒性或安全性方面。它示出,在对抗传感器的存在下,切换其感测到的读数和注入二进制噪声,分离性的缩放定律保持不受影响。

英文摘要:

We consider the problem where a network of sensors has to detect the presence of targets at any of $n$ possible locations in a finite region. All such locations may not be occupied by a target. The data from sensors is fused to determine the set of locations that have targets. We term this the separability problem. In this paper, we address the separability of an asymptotically large number of static target locations by using binary proximity sensors. Two models for target locations are considered: (i) when target locations lie on a uniformly spaced grid; and, (ii) when target locations are i.i.d. uniformly distributed in the area. Sensor locations are i.i.d uniformly distributed in the same finite region, independent of target locations. We derive conditions on the sensing radius and the number of sensors required to achieve separability. Order-optimal scaling laws, on the number of sensors as a function of the number of target locations, for two types of separability requirements are derived. The robustness or security aspects of the above problem is also addressed. It is shown that in the presence of adversarial sensors, which toggle their sensed reading and inject binary noise, the scaling laws for separability remain unaffected.

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

↑