GA-based Sweep Coverage Scheme in WSN

The minimum number of required sensors problem in sweep coverage, one of the important coverage problems in WSN, using a small number of mobile sensor nodes to satisfy both POI (Point of Interest) coverage and data delivery is a dynamic coverage problem. To find the minimum number of mobile sensor nodes with a uniform speed to guarantee sweep coverage was proved to be a NP-hard problem. In this paper, we investigate the minimum number of required sensors problem in sweep coverage to minimize the number of mobile sensor nodes with limited data buffer size while satisfying dynamical POI coverage and data delivery simultaneously. A GA-based Sweep Coverage scheme (GASC) to solve the problem is proposed. In GASC, a random route generation is first introduced to create the initial routes for POIs, and then Genetic Algorithm is employed to optimize these routes. Computational results show that the proposed GASC approach outperforms all previously known and published methods.