基于正三角形剖分的传感器网络覆盖判定算法

覆盖问题是传感器网络研究中的一个基础课题,如何判定某个感兴趣的区域是否被一组给定的传感器节点覆盖,在传感器网络的许多监控应用领域中具有重要意义。提出了一种传感器网络中基于正三角形剖分的快速κ-覆盖判定算法和最大κ-覆盖问题的求解算法,新算法首先把感兴趣区域剖分为正三角形区域,从而将复杂的区域覆盖问题转化为简单的正三角形区域覆盖问题。理论分析与仿真实验表明,针对具有n个节点的传感器网络,新算法的计算时间复杂度为O（n）,低于已有算法O（nlogn）的计算时间复杂度。

Equilateral Triangle Partition-based Coverage Decision Algorithm for Sensor Networks

Coverage problem is a fundamental issue in the researches of sensor networks. It is important to determine whether a region of interest is sufficiently covered by a given set of sensors in lots of monitoring applications of sensor networks. An Equilateral Triangle Partition based Rapid k-Coverage Decision Algorithm and a solution algorithm of maximum k-Coverage problem were proposed, in which the region of interest is partitioned into equilateral triangles firstly, and then the complex area coverage problem is transformed into simple equilateral triangle coverage problem. Theoretical analysis and simulation results show that, for sensor networks with n different sensors, the new algorithm can solve the k-coverage problem correctly for any given region of interest with computation time cost of O(n) only, which is far below the computation time cost O(nlogn) of previously well-known algorithms.