Designing routes for source coding with explicit side information in sensor networks

IEEE/ACM Transactions on Networking

Volumn 15, Issue 6, 2007, Pages 1401-1413

  Luo, Huiyu ^a   Pottie, Gregory J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computational complexity; Data centric routing; Maximum weight branching; NP hardness; Routing; Sensor fusion; Shortest path tree; Source coding; Steiner tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); OPTIMIZATION; SENSOR NETWORKS;

DATA-CENTRIC ROUTING; MAXIMUM WEIGHT BRANCHING; SHORTEST PATH TREE; SOURCE CODING; STEINER TREE;

SENSOR DATA FUSION;

EID: 37549021056     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.900703     Document Type: Article

References (27)

1. B. Krishnamachari, D. Estrin, and S. Wicker, "Modelling data-centric routing in wireless sensor network," Univ. of Southern California, Los Angeles, Tech. Rep. CENG 02-14, 2002.
2. R. Cristescu, B. Beferull-Lozano, and M. Vetterli, "On network correlated data gathering," in Proc. IEEE INFOCOM, Hong Kong, Mar. 2004, pp. 2571-1582.
3. P. von Rickenbach and R. Wattenhofer, "Gathering correlated data in sensor networks," presented at the DialM-POMC, Philadelphia, PA, Oct. 2004.
4. A. Goel and D. Estrin, "Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk," presented at the ACM/SlAM Symp. Discrete Algorithms, Baltimore, MD, 2003.
5. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva, "Directed diffusion for wireless sensor networking," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 2-16, Feb. 2003.
6. S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning trees and shortest-path trees," Algorithmica, vol. 14, pp. 305-321, 1995.
7. G. Pottie and W. Kaiser, "Wireless sensor networks," Commun. ACM vol. 43, no. 5, pp. 51-58, May 2000.
8. R. Zamir and T. Berger, "Multiterminal source coding with high resolution," IEEE Trans. Inf. Theory, vol. 45, no. 1, pp. 106-117, Jan. 1999.
9. S. S. Pradhan, J. Kusuma, and K. Ramchandran, "Distributed compression in a dense microsensor network," IEEE Commun. Mag., vol. 19, no. 3, pp. 51-60, Mar. 2002.
10. Z. Xiong, A. D. Liveris, and S. Cheng, "Distributed source coding for sensor networks," IEEE Signal Process. Mag., vol. 21, no. 5, pp. 80-94, Sep. 2004.
11. H. Luo, Y. Tong, and G. Pottie, "A two-stage DPCM scheme for wireless sensor networks," in Proc. IEEE Int. Conf. Accoustic, Speech, and Signal Processing, Philadelphia, PA, 2005, pp. iii/661-iii/664.
12. J. Chen, L. Yip, J. Elson, H. Wang, D. Maniezzo, R. E. Hudson, K. Yao, and D. Estrin, "Coherent acoustic array processing and localization on wireless sesnor networks," Proc. IEEE, vol. 91, no. 8, pp. 1154-1162, Aug. 2003.
13. A. Scaglione and S. Servetto, "On the interdependence of routing and data compression in multi-hop sensor networks," presented at the ACM/IEEE Mobicom, Atlanta, GA, 2002.
14. S. Bandyopadhyay and E. J. Coyle, "An energy efficient hierarchical clustering algorithm for wireless sensor networks," in Proc. IEEE INFOCOM, 2003, pp. 1713-1723.
15. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proc. 33rd Hawaii Int. Conf. System Sciences, Maui, HL Jan. 2000, p. 8020.
16. K. Bharath-Kumar and J. M. Jaffe, "Routing to multiple destinations in computer networks," IEEE Trans. Commun., vol. COM-31, no. 3, pp. 343-351, Mar. 1983.
17. H. Luo and G. J. Pottie, "Routing explicit side information for data compression in wireless sensor networks," in Proc. Int. Conf. Distributed Computing in Sensor Systems, Marina del Rey, CA, Jun. 2005, pp. 75-88.
18. H. Luo and G. Pottie, "Balanced aggregation trees for routing correlated data in wireless sensor networks," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 14-18.
19. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman, 1979.
20. J. H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad-hoc networks," in Proc. IEEE INFOCOM, 2000, pp. 22-31.
21. S. Singh, M. Woo, and C. S. Raghavendra, "Power-aware routing in mobile ad-hoc networks," in Proc. ACM/IEEE Mobicom, Dallas, TX, 1998, pp. 181-190.
22. Y. J. Chu and T. H. Liu, "On the shortest arborescence of a directed graph," Science Sinica, vol. 14, pp. 1396-1400, 1965.
23. J. Edmonds, "Optimum branchings," J. Res. National Bureau of Standards, vol. 71B, pp. 233-240, 1967.
24. H. Takahashi and A. Matsuyama, "An approximate solution for the steiner problem in graphs," Math. Japonica, vol. 24, no. 6, pp. 573-577, 1980.
25. 2 messages," J. Algorithms, vol. 24, pp. 20-36, 1997.
26. P. A. Humblet, "A distributed algorithm for minimum weight directed spanning trees," IEEE Trans. Commun., vol. COM-31, no. 6, pp. 756-762, Jun. 1983.
27. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem Amsterdam: North-Holland, 1992.