Greedy Algorithm for Target Q Coverage in Wireless Sensor Networks

Hoon KIM; Youn-Hee HAN; Sung-Gi MIN

doi:10.1587/transcom.E94.B.3137

Greedy Algorithm for Target Q Coverage in Wireless Sensor Networks

Hoon KIM, Youn-Hee HAN, Sung-Gi MIN

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E94-B No.11 pp.3137-3139

Publication Date: 2011/11/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E94.B.3137

Type of Manuscript: LETTER

Category: Network

Cite this

Copy

Hoon KIM, Youn-Hee HAN, Sung-Gi MIN, "Greedy Algorithm for Target Q Coverage in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications, vol. E94-B, no. 11, pp. 3137-3139, November 2011, doi: 10.1587/transcom.E94.B.3137.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.3137/_p

Copy

@ARTICLE{e94-b_11_3137,
author={Hoon KIM, Youn-Hee HAN, Sung-Gi MIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Greedy Algorithm for Target Q Coverage in Wireless Sensor Networks},
year={2011},
volume={E94-B},
number={11},
pages={3137-3139},
abstract={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.},
keywords={},
doi={10.1587/transcom.E94.B.3137},
ISSN={1745-1345},
month={November},}

Copy

TY - JOUR
TI - Greedy Algorithm for Target Q Coverage in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3137
EP - 3139
AU - Hoon KIM
AU - Youn-Hee HAN
AU - Sung-Gi MIN
PY - 2011
DO - 10.1587/transcom.E94.B.3137
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2011
AB - 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.
ER -