Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Data Gathering in SEnsor Networks using the Energy Delay Metric
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient gathering of correlated data in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Scalable data aggregation for dynamic events in sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Structure-Free Data Aggregation in Sensor Networks
IEEE Transactions on Mobile Computing
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Energy Efficient Correlated Data Aggregation for Wireless Sensor Networks
International Journal of Distributed Sensor Networks - Selected Papers in Innovations and Real-Time Applications of Distributed Sensor Networks
Utility-based data-gathering in wireless sensor networks with unstable links
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Adaptive data collection in sensor networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
| Hi-index | 0.00 |
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 solutions close to a computationally heavy heuristic used as benchmark, simulated annealing, which is provably optimal in the limit.