Efficient gathering of correlated data in sensor networks
- 25 May 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 402-413
- https://doi.org/10.1145/1062689.1062739
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Simulating the power consumption of large-scale sensor network applicationsPublished by Association for Computing Machinery (ACM) ,2004
- The impact of spatial correlation on routing with compression in wireless sensor networksPublished by Association for Computing Machinery (ACM) ,2004
- Scale Free Aggregation in Sensor NetworksLecture Notes in Computer Science, 2004
- Power efficient gathering of correlated data: optimization, NP-completeness and heuristicsACM SIGMOBILE Mobile Computing and Communications Review, 2003
- On the interdependence of routing and data compression in multi-hop sensor networksPublished by Association for Computing Machinery (ACM) ,2002
- Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networksPublished by Association for Computing Machinery (ACM) ,2002
- Message-optimal connected dominating sets in mobile ad hoc networksPublished by Association for Computing Machinery (ACM) ,2002
- Geography-informed energy conservation for Ad Hoc routingPublished by Association for Computing Machinery (ACM) ,2001
- Approximation Algorithms for Connected Dominating SetsAlgorithmica, 1998
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994