Barrier coverage with wireless sensors
Barrier coverage with wireless sensors
复制标题
DOI：
10.1007/s11276-006-9856-0
复制
发表时间：
2007-01-01
影响因子：
3
通讯作者：
Arora, Anish
中科院分区：
文献类型：
--
作者：
Kumar, Santosh;Lai, Ten H.;Arora, Anish
当部署传感器网络以检测穿透受保护区域的物体时，不必使部署区域中的每个点都被传感器覆盖。如果穿透物体在其轨迹中的某个点被检测到就足够了。如果一个传感器网络保证每一个穿透物体在穿过无线传感器的屏障之前都能被至少k个不同的传感器检测到，我们就说这个网络提供了k屏障覆盖。在本文中，我们发展的理论基础，k-势垒覆盖。我们提出了有效的算法，使用它可以快速确定，部署后的传感器，是否部署区域是k-障碍覆盖。接下来，我们建立了最佳的部署模式，以实现k-障碍覆盖时，部署传感器确定性。最后，我们考虑了高概率的障碍覆盖时，传感器的随机部署。主要的挑战，当处理概率障碍覆盖，是获得临界条件，使用它可以计算出的最小数量的传感器，以确保高概率的障碍覆盖。然而，导出k势垒覆盖的临界条件仍然是一个悬而未决的问题。我们推导出临界条件较弱的概念的障碍覆盖，称为弱k-障碍覆盖。
When a sensor network is deployed to detect objects penetrating a protected region, it is not necessary to have every point in the deployment region covered by a sensor. It is enough if the penetrating objects are detected at some point in their trajectory. If a sensor network guarantees that every penetrating object will be detected by at least k distinct sensors before it crosses the barrier of wireless sensors, we say the network provides k-barrier coverage. In this paper, we develop theoretical foundations for k-barrier coverage. We propose efficient algorithms using which one can quickly determine, after deploying the sensors, whether the deployment region is k-barrier covered. Next, we establish the optimal deployment pattern to achieve k-barrier coverage when deploying sensors deterministically. Finally, we consider barrier coverage with high probability when sensors are deployed randomly. The major challenge, when dealing with probabilistic barrier coverage, is to derive critical conditions using which one can compute the minimum number of sensors needed to ensure barrier coverage with high probability. Deriving critical conditions for k-barrier coverage is, however, still an open problem. We derive critical conditions for a weaker notion of barrier coverage, called weak k-barrier coverage.