A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Power efficient gathering of correlated data: optimization, NP-completeness and heuristics
2003
ACM SIGMOBILE Mobile Computing and Communications Review
This paper studies the interaction between the communication costs in a sensor network and the structure of the data that it measures. We formulate an optimization problem for power efficient data gathering and show that the problem is NP-complete. We propose scalable, distributed and efficient heuristics for solving this problem and show by numerical simulations that the power consumption can be significantly improved over direct transmission or the shortest path tree. Our algorithms provide
doi:10.1145/961268.961278
fatcat:bzzmsjn3mrbl3hb5kpbzjbtxta