Efficient data gathering in sensor network is an important challenge. In this paper we address the problem of gathering sensed data to the sink of a sensor network minimizing the time to complete the process. We present optimal time data gathering algorithms for any type of topology of a sensor network. Our results improve on existing approximation algorithms. We approach the gathering problem by obtaining optimal solutions to the collision-free paths coloring problem. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Gargano, L., & Rescigno, A. A. (2006). Optimally fast data gathering in sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4162 LNCS, pp. 399–411). Springer Verlag. https://doi.org/10.1007/11821069_35
Mendeley helps you to discover research relevant for your work.