Solving Sensor Grouping Coverage Problem Based on Greedy Algorithms

Using sensors to monitor water quality and disaster attracts more and more attention. To maximize the coverage of a limited number of sensors grouping or under other restrictions has always been an important research question. A method consecutively applying greedy selection property twice, each focuses on different factors, was proposed to calculate the area of sensors grouping coverage. The experiments show that this method is an optimal solution for the question. Particularly in a large number of sensors, its efficiency was gained much improvement compared with dynamic programming and other algorithms.