Design of Memetic Algorithm to Enhance Coverage in Wireless Sensor Networks with Minimum Number of Sensors

Abstract: Wireless sensor networks are a rapidly growing area for research & development. The sensor coverage problem is prime factor being considered in recent advances. The coverage concept is subject to a wide range of interpretations due to different types of sensors and their applications. Genetic algorithm determines the optimal combination of sensor to achieve an objective of an efficient coverage and connectivity of sensors. The Genetic Algorithms restricts Reproduction, Crossover, and Mutation Operation to Sensors. Memetic Algorithm is Type Of Genetic Algorithms used to enhance the coverage and minimizes the number of sensors should be deployed , with minimum number of sensors efficient coverage is possible by eliminating the inefficient sensors by using population best fit method is used in this paper. To obtain the Memetic algorithm we also discuss about set k cover problem to identify which sensors are having efficient coverage and NP complete problem is discussed in this paper. The simulation results shown in this paper proves that we are achieving efficient coverage with minimum number of sensors.

Keywords: sensor coverage, Memetic algorithm, set k cover problem, NP complete