【摘要】 提出了一种传感器网络中基于立方体剖分的三维k-覆盖快速判定算(CP-RTCDA)和三维最大k-覆盖问题的快速求解算法(CP-RTMCDA)。算法首先把感兴趣区域剖分为立方体区域,从而将复杂的空间区域覆盖问题转化为简单的立方体区域覆盖问题。理论分析与仿真实验表明,针对具有n个节点的传感器网络,新算法的计算时间复杂度为O(n),远低于已有算法O(n~3logn)的计算时间复杂度。更多还原

【Abstract】 A Cube Partition based Rapid Three-dimensional k-Coverage Decision Algorithm (CP-RTCDA)was proposed, in which the region of interest was partitioned into triangles firstly, and then the complex area coverage problem was transformed into simple triangle coverage problem. Theoretical analysis and simulation results show that, for sensor networks with different sensors, the new algorithm can solve the k-coverage problem correctly for any given region of interest with time costs of O ( n ) only, which is far below the time costs O ( n3 log n ) of other algorithms.更多还原