Journal of Computers (JCP)
Wireless sensor networks have several applications, such as target detection and tracking and monitoring battlefields. Coverage is one of the most important performance metrics for wireless sensor networks since it reflects how appropriate an event can be detected and monitored in the sensing field. To achieve optimal coverage, an efficient algorithm should be employed to find the best positions of sensor node deployment. In this paper, an efficient genetic algorithm is proposed to solve the coverage problem of the target objects. The optimal number of sensor nodes starts from fewer randomly deployed nodes and increases gradually in subsequence generations.