Greedy algorithm for target Q coverage in wireless sensor networks

Target Q coverage is needed to secure the stability of data collection in WSN. The targets may have different level of importance then the multiple-target coverage scheme must schedule sensors according to each target's weight to increase the network lifetime. The schedule scheme previously proposed for weighted coverage uses an iterative solution to solve the problem but it has long computation time. We propose a heuristic greedy-TQC algorithm to use the residual energy of sensors to generate multiple scheduling cover sets. A simulation shows a dramatic reduction in computation time. The greedy-TQC algorithm is suitable for the frequently topology-changing WSN and for the often changing targets' weights in WSN.