Greedy algorithm for target Q coverage in wireless sensor networks

Hoon Kim, Youn Hee Han, Sung Gi Min

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)3137-3139
Number of pages3
JournalIEICE Transactions on Communications
Issue number11
Publication statusPublished - 2011 Nov


  • Greedy algorithm
  • Power saving
  • Sensor scheduling
  • Target coverage

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Greedy algorithm for target Q coverage in wireless sensor networks'. Together they form a unique fingerprint.

Cite this