Dividing target-coverage graph in Wireless Sensor Networks

In order to reduce the algorithm complexity of the target coverage problem which is a NP-complete problem, we design three approaches to shorten the network scale. We firstly delete redundant sensor nodes, secondly remove the redundant targets, and thirdly divide the target-coverage graph into independent sub-graphs, and present the construct independent sub graph algorithm (CISGA) to divide target-coverage graph. Measurement results show that CISGA could reduce 30% of network scale and greatly reduce the algorithm complexity of target coverage problem.