Coverage quality problem in wireless sensor networks

Extending lifetime by scheduling node state and maintaining the coverage quality are two important aspects in wireless sensor networks (WSNs). It was presented a mathematical model to compute minimum number of nodes under any given required coverage quality. Simulation results demonstrate that our approach is more accurate to compute minimum number of working nodes when the ratio of target region to sensor region is larger, and the complexity of this method is lower while the sensor's region can be perceived as arbitrary shapes. It is an NP-hard problem that network's coverage quality and ratio of sleeping nodes get to maximize together. It tried to solve this problem by using genetic algorithm for the experiments, which is significant in WSNs for the practical applications.