O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks

My T. Thai, Yingshu Li, Ding Zhu Du, Feng Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Many centralized algorithms have been proposed to solve this problem. A. very few distributed versions have also been presented but none of them obtains a good approximation ratio. In this paper, we propose two O(logn) localized algorithms. In particular, we first reduce the MTC problem to the domatic number problem in directed graphs. This relation shows that a feasible solution to the domatic number problem is also a feasible solution to the MTC problem. We next prove the lower and upper bounds of this domatic number. Based on this proof, we present two O(log n)-localized algorithms to solve the MTC problem.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the IEEE International Performance, Computing, and Communications Conference
Pages85-92
Number of pages8
DOIs
StatePublished - 2007
Externally publishedYes
Event27th IEEE International Performance Computing and Communications Conference, IPCCC 07 - New Orleans, LA, United States
Duration: Apr 11 2007Apr 13 2007

Other

Other27th IEEE International Performance Computing and Communications Conference, IPCCC 07
CountryUnited States
CityNew Orleans, LA
Period4/11/074/13/07

Fingerprint

Heterogeneous networks
Sensor networks
Directed graphs

Keywords

  • Coverage problem
  • Domatic number
  • Dominating set partition
  • Energy efficiency

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Thai, M. T., Li, Y., Du, D. Z., & Wang, F. (2007). O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks. In Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (pp. 85-92). [4197918] https://doi.org/10.1109/PCCC.2007.358882

O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks. / Thai, My T.; Li, Yingshu; Du, Ding Zhu; Wang, Feng.

Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. 2007. p. 85-92 4197918.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Thai, MT, Li, Y, Du, DZ & Wang, F 2007, O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks. in Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference., 4197918, pp. 85-92, 27th IEEE International Performance Computing and Communications Conference, IPCCC 07, New Orleans, LA, United States, 4/11/07. https://doi.org/10.1109/PCCC.2007.358882
Thai MT, Li Y, Du DZ, Wang F. O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks. In Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. 2007. p. 85-92. 4197918 https://doi.org/10.1109/PCCC.2007.358882
Thai, My T. ; Li, Yingshu ; Du, Ding Zhu ; Wang, Feng. / O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. 2007. pp. 85-92
@inproceedings{fd8d72e6c38e44b6ab113d868cdf09d5,
title = "O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks",
abstract = "In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Many centralized algorithms have been proposed to solve this problem. A. very few distributed versions have also been presented but none of them obtains a good approximation ratio. In this paper, we propose two O(logn) localized algorithms. In particular, we first reduce the MTC problem to the domatic number problem in directed graphs. This relation shows that a feasible solution to the domatic number problem is also a feasible solution to the MTC problem. We next prove the lower and upper bounds of this domatic number. Based on this proof, we present two O(log n)-localized algorithms to solve the MTC problem.",
keywords = "Coverage problem, Domatic number, Dominating set partition, Energy efficiency",
author = "Thai, {My T.} and Yingshu Li and Du, {Ding Zhu} and Feng Wang",
year = "2007",
doi = "10.1109/PCCC.2007.358882",
language = "English (US)",
isbn = "1424411386",
pages = "85--92",
booktitle = "Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference",

}

TY - GEN

T1 - O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks

AU - Thai, My T.

AU - Li, Yingshu

AU - Du, Ding Zhu

AU - Wang, Feng

PY - 2007

Y1 - 2007

N2 - In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Many centralized algorithms have been proposed to solve this problem. A. very few distributed versions have also been presented but none of them obtains a good approximation ratio. In this paper, we propose two O(logn) localized algorithms. In particular, we first reduce the MTC problem to the domatic number problem in directed graphs. This relation shows that a feasible solution to the domatic number problem is also a feasible solution to the MTC problem. We next prove the lower and upper bounds of this domatic number. Based on this proof, we present two O(log n)-localized algorithms to solve the MTC problem.

AB - In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Many centralized algorithms have been proposed to solve this problem. A. very few distributed versions have also been presented but none of them obtains a good approximation ratio. In this paper, we propose two O(logn) localized algorithms. In particular, we first reduce the MTC problem to the domatic number problem in directed graphs. This relation shows that a feasible solution to the domatic number problem is also a feasible solution to the MTC problem. We next prove the lower and upper bounds of this domatic number. Based on this proof, we present two O(log n)-localized algorithms to solve the MTC problem.

KW - Coverage problem

KW - Domatic number

KW - Dominating set partition

KW - Energy efficiency

UR - http://www.scopus.com/inward/record.url?scp=36349028568&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36349028568&partnerID=8YFLogxK

U2 - 10.1109/PCCC.2007.358882

DO - 10.1109/PCCC.2007.358882

M3 - Conference contribution

AN - SCOPUS:36349028568

SN - 1424411386

SN - 9781424411382

SP - 85

EP - 92

BT - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference

ER -