Studying on minimal cover set node deployment in wireless sensor networks

Studying on coverage problem is the premise and guarantee of implementing data collection, monitoring and a series of other functions for WSNs. Using the least amount of nodes to realize the regional coverage can effectively reduce the data redundancy and the collision among nodes. The greedy approximate algorithm (GAA) on minimum coverage set is put forward by this paper. In the process of constructing coverage set, from the geometric position among the nodes, we discussed the location relationships of the sensor nodes of the random deployment in different situations. Then the prioritization of different situation is given for comprehensively considering to select nodes to join cover set, respectively according to the distance, the surplus energy, the increase area, and the location relationship between arc intersection points. Finally, through the simulation experiments, the size of the coverage set and the algorithm running time of GAA, GA, and CVT algorithms are compared. And the experimental results show that the GAA is better than the other two algorithms.