Voronoi Tessellation Based Rapid Coverage Decision Algorithm For Wireless Sensor Networks

Coverage problem is a fundamental issue in the researches of sensor networks. In lots of applications area of sensor networks such as monitoring etc, it is of great importance to determine that whether the area of interest is completely covered by a given set of sensors. A novel voronoi tessellation based rapid coverage decision algorithm is proposed, in which the area of interest is partitioned into square grid firstly, and then the complex area coverage problem is transformed into simple vertexes coverage problem by using Voronoi Tessellation models. Theoretical analysis and simulation results show that, compared with existed algorithms, the new algorithm has good correctness rate of coverage decision, lower computation complexity, and for sensor networks with n different sensors, can determine that whether a randomly given area of interest is completely covered by the n different sensors with time cost of O(nlogn).The contents of this article are as following:(1) The background outline of the subject both national and international.(2) The analysis of security of wireless sensor networks, introduction of existing several algorithms of coverage problem.(3) Analyze So&Ye's TCID algorithm and on this basis,propose VT-RCDA.(4) Design a simulation experimental platform by JAVA language, to demensrate the sensor distribution and determine whether a region is covered by the sensers.At last,analyze the performance in all aspects.(5) Make an evaluation of these algorihms and summeraize them.