Balanced aggregation trees for routing correlated data in wireless sensor networks

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 14-18

  Luo, Huiyu ^a   Pottie, Gregory ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA RATE MODEL; FUSION CENTERS; HEURISTIC ALGORITHMS; SENSOR NETWORKS;

COMPUTER SIMULATION; CORRELATION THEORY; DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; SENSORS; SIGNAL ENCODING; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

NETWORK PROTOCOLS;

EID: 33749446703     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523283     Document Type: Conference Paper

References (17)

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, 2002.
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. S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning trees and shortest-path trees," Algorithmica, vol. 14, pp 305-321, 1995.
6. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.
7. R. Zamir and Toby Berger, "Multiterminal source coding with high resolution," IEEE Trans. Inform. Theory, vol. 45, no. 1, Jan 1999.
8. H. Luo, Y. Tong, and G. Pottie, "A two-stage DPCM scheme for wireless sensor networks," to appear in ICASSP 2005, Philadelphia, USA.
9. J. Chen et al. "Coherent acoustic array processing and localization on wireless sesnor networks," Proc. IEEE, vol. 91, no. 8, Aug 2003.
10. H. Viswanathan and T. Berger, "The quandratic Gaussian CEO problem," IEEE Trans. Inform. Thoery, vol. 43, no. 5, Sep 1997.
11. S. Pradhan, J. Kusuma, and K. Ramchandran, "Distributed compression in a dense microsensor network," IEEE Sig. Proc. Mag., March, 2002.
12. A. Scaglione and S. Servetto, "On the interdependence of routing and data compression in multi-hop sensor networks," Mobicom, 2002.
13. S. Tatikonda and K. Ramchandran, "Coding and routing complexity in sensor networks," ISIT, 2004, Chicago, USA.
14. S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," IEEE Infocom, 2003.
15. 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.
16. H. Luo and G. Pottie, "Routing explicit side information for data compression in wireless sensor networks," DCOSS 2005.
17. H. Takahashi and A. Matsuyama, "An approximate solution for the steiner problem in graphs," Math. Japonica, 24, No. 6, pp 573-577, 1980.