论文部分内容阅读
覆盖问题是传感器网络研究中的一个基础课题,判定感兴趣的区域是否被一组给定的传感器节点完全覆盖,在监控等传感器网络的许多应用领域中具有重要意义。提出了一种传感器网络中基于Voronoi网格的快速覆盖判定算法VT-RCDA(Voronoi Tessellation based Rapid Coverage Decision Algorithm)。算法首先将感兴趣的区域进行正方形网格剖分,然后采用Voronoi网格模型将复杂的区域覆盖问题转化为简单的顶点覆盖问题。理论分析与仿真实验表明,与已有算法相比,新算法具有较好的覆盖判定正确率,较低的计算复杂度,且针对具有n个节点的传感器网络,能在O(nlogn)的时间开销内快速判断出任意给定感兴趣区域能否被这n个传感器节点覆盖。
Coverage is a basic issue in the research of sensor networks. Determining whether a region of interest is completely covered by a given set of sensor nodes is of great importance in many application fields such as monitoring and sensor networks. A Voronoi Tessellation based Rapid Coverage Decision Algorithm (VT-RCDA) algorithm based on Voronoi grid in sensor networks is proposed. Firstly, the algorithm divides the area of interest into square grids and then uses the Voronoi grid model to transform the complex area coverage problem into a simple vertex coverage problem. Theoretical analysis and simulation results show that compared with the existing algorithms, the new algorithm has better accuracy of coverage determination and lower computational complexity. For the sensor network with n nodes, It is quickly determined within a cost whether any given region of interest can be covered by these n sensor nodes.