In a Wireless Sensor Network (WSN), when a large amount of sensors are randomly deployed into a detection area, an efficient sleep/active scheduling for sensors to maximize the network lifetime of target (or detection area) coverage, which is called the coverage problem, is an important issue. The problem was proved NP-complete. Recently, many methods were proposed for solving the coverage problem, each of which can be divided into two phases: the first is to find as many as possible coverage sets from the sensors and the other is to schedule t...
