Cube partitionbased rapid three-dimensional k-coverage decision algorithm for sensor networks
基于立方体剖分的传感器网络快速三维k-覆盖判定算法

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.