On k-coverage in a mostly sleeping sensor network
On k-coverage in a mostly sleeping sensor network
复制标题
DOI：
10.1007/s11276-006-9958-8
复制
发表时间：
2008-06-01
影响因子：
3
通讯作者：
Balogh, Jozsef
中科院分区：
文献类型：
--
作者：
Kumar, Santosh;Lai, Ten H.;Balogh, Jozsef
传感器网络通常需要比单个传感器的有效寿命长许多倍。这通常是通过使传感器在其生命周期的大部分时间内处于睡眠状态来实现的。另一方面，事件监控应用程序需要始终保证受保护区域的k覆盖。因此，确定同时实现这两个目标的适当数量的传感器部署成为一个具有挑战性的问题。在本文中，我们考虑了三种部署的传感器网络上的一个单位平方根n ×根n网格，随机均匀（所有n个点），泊松（密度为n）。在所有三种部署中，每个传感器都以概率p活动，独立于其他传感器。然后，我们证明了函数np pi r（2）/log（np）对于每个点的k-覆盖事件的临界值为1。我们还提供了一个上限的窗口，这个相变。虽然这三种部署的条件是相似的，我们得到更清晰的边界随机部署比网格部署，这是由于边界条件。在本文中，我们还提供了更正以前发表的结果。最后，我们使用模拟来展示我们的分析在真实的部署场景中的有用性。
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their lifetime. On the other hand, event monitoring applications require guaranteed k-coverage of the protected region at all times. As a result, determining the appropriate number of sensors to deploy that achieves both goals simultaneously becomes a challenging problem. In this paper, we consider three kinds of deployments for a sensor network on a unit square-a root n x root n grid, random uniform (for all n points), and Poisson (with density n). In all three deployments, each sensor is active with probability p, independently from the others. Then, we claim that the critical value of the function np pi r(2)/log (np) is 1 for the event of k-coverage of every point. We also provide an upper bound on the window of this phase transition. Although the conditions for the three deployments are similar, we obtain sharper bounds for the random deployments than the grid deployment, which occurs due to the boundary condition. In this paper, we also provide corrections to previously published results. Finally, we use simulation to show the usefulness of our analysis in real deployment scenarios.