Routing explicit side information for data compression in wireless sensor networks

Lecture Notes in Computer Science

Volumn 3560, Issue , 2005, Pages 75-88

  Luo, Huiyu ^a   Pottie, Gregory ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGLOMERATION; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

COST MINIMIZATION; DATA AGGREGATION; DATA FUSION; SENSOR NETWORKS;

DATA COMPRESSION;

EID: 26444610113     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11502593_9     Document Type: Conference Paper

References (18)

1. G. Pottie and W. Kaiser, "Wireless sensor networks," Comm. ACM, vol. 43, no. 5, pp. 51-58, May 2000.
2. B. Krishnamachari, D. Estrin, and S. Wicker, "Modelling data-centric routing in wireless sensor network," USC Computer Engineering Technical Report CENG 02-14.
3. C. Intanagonwiwat, et al. "Directed diffusion for wireless sensor networking," IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 2-16, Feb 2003.
4. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "On network correlated data gathering," IEEE Infocom, Hongkong, March 7-11, 2004.
5. A. Goel and D. Estrin, "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk," ACM/SIMA Symposium on Discrete Algorithms, 2003.
6. H. Luo, Y. Tong, and G. Pottie, "A two-stage DPCM scheme for wireless sensor networks," to appear in ICASSP 2005, Philadelphia, USA.
7. A. Scaglione and S. Servetto, "On the interdependence of routing and data compression in multi-hop sensor networks," ACM/IEEE Mobicom, 2002.
8. S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," IEEE Infocom, 2003.
9. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication procotol for wireless microsensor networks," Hawaii Inter. Conf. System Sciences, Jan. 4-7, 2000.
10. R. E. Tarjan, "Finding optimum branchings," Networks, pp 25-35, vol. 7, 1977.
11. H. Takahashi and A. Matsuyama, "An approximate solution for the steiner problem in graphs," Math. Japonica, 24, No. 6, pp 573-577, 1980.
12. J. H. Chang, L. Tassiulas, "Energy conserving routing in wireless ad-hoc networks," IEEE Infocom, 2000.
13. S. Singh, M. Woo, C. S. Raghavendra, "Power-aware routing in mobile ad-hoc networks," ACM/IEEE Mobicom, 1998, Dallas, Texas.
14. R. Willett, A. Martin, and R. Nowak, "Backcasting: adaptive sampling for sensor networks," IPSN, 2004, Berkeley, Ca, USA.
15. D. Ganesan, R. Cristescu, and B. Beferull-Lozano, "Power-efficient sensor placement and transmission structure for data gathering under distortion constraints," IPSN, 2004, Berkeley, Ca, USA.
16. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.
17. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
18. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, North-Holland, 1992.