Localized algorithms for coverage boundary detection in wireless sensor networks
Localized algorithms for coverage boundary detection in wireless sensor networks
复制标题
DOI：
10.1007/s11276-007-0021-1
复制
发表时间：
2007-02
影响因子：
3
通讯作者：
Chi Zhang;Yanchao Zhang;Yuguang Fang
中科院分区：
文献类型：
--
作者：
Chi Zhang;Yanchao Zhang;Yuguang Fang
连接覆盖反映了基站对目标区域的监控效果，是衡量无线传感器网络（WSNs）监控质量的重要指标。为了便于测量这个度量，我们提出了两种新的算法，为个别传感器节点，以确定他们是否在覆盖范围的边界，即，覆盖空洞或网络分区的边界。我们的算法是基于两个新的计算几何技术，称为本地化Voronoi和邻居拥抱多边形。与以前的工作相比，我们的算法可以适用于任意拓扑结构的无线传感器网络。该算法是完全分布式的，只需要一跳邻居的最小位置信息和有限数量的简单局部计算，因此具有很高的可扩展性和能量效率。通过理论证明和大量仿真，证明了算法的正确性和有效性。
Connected coverage, which reflects how well a target field is monitored under the base station, is the most important performance metric used to measure the quality of surveillance that wireless sensor networks (WSNs) can provide. To facilitate the measurement of this metric, we propose two novel algorithms for individual sensor nodes to identify whether they are on the coverage boundary, i.e., the boundary of a coverage hole or network partition. Our algorithms are based on two novel computational geometric techniques called localized Voronoi and neighbor embracing polygons. Compared to previous work, our algorithms can be applied to WSNs of arbitrary topologies. The algorithms are fully distributed in the sense that only the minimal position information of one-hop neighbors and a limited number of simple local computations are needed, and thus are of high scalability and energy efficiency. We show the correctness and efficiency of our algorithms by theoretical proofs and extensive simulations.