Maintaining Sensing Coverage and Connectivity in Large Sensor Networks
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks
复制标题
DOI：
10.1201/9780203323687.ch28
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Honghai Zhang;J. Hou
中科院分区：
文献类型：
--
作者：
Honghai Zhang;J. Hou
在本文中，我们通过在无线传感器网络中使最少数量的传感器节点处于活动模式来解决保持感知覆盖和连接性的问题。我们通过解决以下两个子问题来研究覆盖和连接之间的关系。首先，我们证明如果无线电射程至少是感知范围的两倍，凸区域的完全覆盖意味着节点工作集之间的连接性。其次，在节点密度足够高的理想情况下，我们推导出一组最优性条件，在这些条件下可以选择工作传感器节点的一个子集来实现完全覆盖。基于这些最优性条件，我们随后设计了一种分散式密度控制算法，即最优地理密度控制（OGDC），用于大规模传感器网络的密度控制。OGDC算法是完全本地化的，无论无线电射程和感知范围之间的关系如何，它都能保持覆盖和连接性。Ns - 2模拟表明，在所需工作节点数量和网络寿命方面（最多可提高50%），OGDC优于现有的密度控制算法[25, 26, 29]，并且实现了与最佳结果算法几乎相同的覆盖。
In this paper, we address the issues of maintaining sensing coverage and connectivity by keeping a minimum number of sensor nodes in the active mode in wireless sensor networks. We investigate the relationship between coverage and connectivity by solving the following two sub-problems. First, we prove that if the radio range is at least twice the sensing range, complete coverage of a convex area implies connectivity among the working set of nodes. Second, we derive, under the ideal case in which node density is sufficiently high, a set of optimality conditions under which a subset of working sensor nodes can be chosen for complete coverage. Based on the optimality conditions, we then devise a decentralized density control algorithm, Optimal Geographical Density Control (OGDC), for density control in large scale sensor networks. The OGDC algorithm is fully localized and can maintain coverage as well as connectivity, regardless of the relationship between the radio range and the sensing range. Ns-2 simulations show that OGDC outperforms existing density control algorithms [25, 26, 29] with respect to the number of working nodes needed and network lifetime (with up to 50% improvement), and achieves almost the same coverage as the algorithm with the best result.