Decomposition of target coverage graph in wireless sensor network

In order to reduce the algorithm complexity of the target coverage problem in Wireless Sensor Network, three kinds of approaches are designed to decrease the network scale, that is, one is deleting the redundant sensor nodes, another is removing the redundant targets, and the third is decomposing the target coverage graph into multiple independent sub graphs. This paper proves that the three approaches are correct, and presents the Construct Independent Sub Graph Algorithm(CISGA) to divide target coverage graph. Experiment results show that CISGA can reduce 30% of network scale and greatly reduce the algorithm complexity of target coverage problem. © Fang Zhao.