@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",
month = nov,
day = "27",
doi = "10.1109/PCCC.2007.358882",
language = "English (US)",
isbn = "1424411386",
series = "Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference",
pages = "85--92",
booktitle = "27th IEEE International Performance Computing and Communications Conference, IPCCC 07",
note = "27th IEEE International Performance Computing and Communications Conference, IPCCC 07 ; Conference date: 11-04-2007 Through 13-04-2007",
}