%0 Conference Proceedings
%T Resource Optimization Algorithm for Sparse Time- Driven Sensor etworks
%+ Department of Mathematics and Computer Science [Palma]
%A Santamaría, María Louisa
%A Galmés, Sebastià
%A Puigjaner, Ramon
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 9th International IFIP TC 6 Networking Conference (NETWORKING)
%C Chennai, India
%Y Mark Crovella; Laura Marie Feeney; Dan Rubenstein; S. V. Raghavan
%I Springer
%3 NETWORKING 2010
%V LNCS-6091
%P 277-290
%8 2010-05-11
%D 2010
%R 10.1007/978-3-642-12963-6_22
%K Time-driven sensor networks
%K TDMA
%K spanning tree
%K minimum spanning tree
%K network planning
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X Time-driven sensor networks are devoted to the continuous reporting of data to the user. Typically, their topology is that of a data-gathering tree rooted at the sink, whose vertexes correspond to nodes located at sampling locations that have been selected according to user or application requirements. Thus, generally these locations are not close to each other and the resulting node deployment is rather sparse. In a previous paper, we developed a heuristic algorithm based on simulated annealing capable of finding an optimal or suboptimal data-gathering tree in terms of lifetime expectancy. However, despite the enhanced lifetime, the overall link distance is not optimized, fact that increases the need for additional resources (relay nodes). Therefore, in this paper we propose the Link Distance Reduction algorithm, with the goal of reducing link distances as long as network lifetime is preserved. The benefits of this new algorithm are evaluated in detail.
%G English
%2 https://inria.hal.science/hal-01059103/document
%2 https://inria.hal.science/hal-01059103/file/CameraReady.pdf
%L hal-01059103
%U https://inria.hal.science/hal-01059103
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6091
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-NETWORKING
%~ IFIP-2010