Voronoi tessellation based rapid coverage decision algorithm for wireless sensor networks

The coverage problem is a fundamental issue in the research of sensor network. A novel Voronoi tessellation based rapid coverage decision algorithm is proposed, in which the region of interest is partitioned into some square Grids firstly, and then the complex area coverage problem is transformed into simple vertices coverage problem, on the basis of the good characteristics of Voronoi tessellation such as being able to divide the planner area into a set of simple geometric simplexes. Theoretical analysis and simulation results show that, the new algorithm can decrease the computation complexity of networks, especially for sensor networks with n different sensors, it can solve the coverage problem correctly for any given region of interest with time costs of O(nlogn) only.