Resource Optimization Algorithm for Sparse Time- Driven Sensor etworks

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01059103
Contributor : Hal Ifip <>
Submitted on : Friday, August 29, 2014 - 1:06:34 PM
Last modification on : Friday, August 11, 2017 - 3:25:08 PM
Long-term archiving on : Sunday, November 30, 2014 - 10:38:26 AM

File

CameraReady.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

María Louisa Santamaría, Sebastià Galmés, Ramon Puigjaner. Resource Optimization Algorithm for Sparse Time- Driven Sensor etworks. 9th International IFIP TC 6 Networking Conference (NETWORKING), May 2010, Chennai, India. pp.277-290, ⟨10.1007/978-3-642-12963-6_22⟩. ⟨hal-01059103⟩

Share

Metrics

Record views

92

Files downloads

99