In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accuracy and cost, in order to study the Earth's surface. One of the most important challenges in this area, is the signaling network coverage and finding holes. In recent years, wireless sensor networks data is taken into consideration as an ideal source, in terms of speed, accuracy and cost, in order to study the Earth's surface. The main task of a sensor is to identify it's near specific physical changes. In most cases, these physical changes happen in a large area size that cannot be measured by a sensor. Therefore, in order to monitor such environments, we need to establish a network of sensors, where in, each sensor is able to communicate with nodes around and analyze the data and requirements. The inherent topology of a sensor network is graph topology. The first condition for having a sensor network is covering the whole area. Coverage confirmation, in both fixed or dynamic networks, is essentially a geometrical problem and the need for geometry data is a solution for calculations. In this paper we estimate the results of  different methods used in order to find the coverage loss areas. Also we compare them and decide the effective, powerful and trusted algorithms.