Design of Efficient Genetic Algorithm using Local Exploration with K Cover to Enhance Coverage in Wireless Sensor Networks

Wireless sensor network  is a rapidly growing area for research and commercial development. Coverage of all targets with minimum number of sensors a key issue in WSN applications such as surveillance. One effective method is to partition the collection of sensors into several covers, each of which must include all targets, and then to activate these covers one by one. The problem of finding the maximum number of covers has been modeled as the set K-cover problem, which has been proven to be NP-complete. This paper proposes a local operator based Genetic algorithm to solve K-cover problem. Proposed solution has high value of disjoint sets at the same time use lesser number of sensors to form cover. A set of unused sensors at the end can be reutilized to deliver the backup support for any cover set if there is any fault available with any member .This will help in enhancing the coverage all targets with minimum number of sensors.