Study On Greedy Algorithm Of Connected Coverage For WSNs

This paper considers the coverage problem of large-scale sensor networks. The coverage problem is a fundamental question:How well do the sensors observe the physical space? The coverage concept is a measure of the quality of service (QoS) of the sensing function and is subject to a wide range of interpretations due to a variety of sensors and applications.This paper summarizes the common sensor network on several classes of overages:barrier coverage, point coverage and area overage. We commonly use the two cover models:Boolean model and probabilistic model. And we make reference to the literature of many evaluation criteria for the coverage problem. In the two common covered algorithms (distributed and centralized), the distributed algorithm is described in detail in the CVT (Centralized Voronoi Tessellation) algorithm, then we propose an alternative model based on probabilistic distributed algorithm:on the condition that the coverage of each discrete grid point is K and the precision is T, this paper presents a new covering algorithm based on the probability model, the simulation of which can be performed with MAT ALB. Simulation results show that the least sensors are needed in this new algorithm compared with the mean algorithm and the randomized algorithm. This algorithm extended to three-dimensional space has been well validated.