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

19 Scopus citations

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 publication27th IEEE International Performance Computing and Communications Conference, IPCCC 07
Pages85-92
Number of pages8
DOIs
StatePublished - Nov 27 2007
Externally publishedYes
Event27th IEEE International Performance Computing and Communications Conference, IPCCC 07 - New Orleans, LA, United States
Duration: Apr 11 2007Apr 13 2007

Publication series

NameConference Proceedings of the IEEE International Performance, Computing, and Communications Conference

Other

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

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'O (log n) -localized algorithms on the coverage problem in heterogeneous sensor networks'. Together they form a unique fingerprint.

Cite this