A 2-approximation double-tree algorithm for correlated data gathering in wireless sensor networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages 898-902

  Weng, Hsien Cheng ^a   Chan, Hope ^b   Wu, Eric Hsiao Kuang ^c   Chen, Gen Huey ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b INSTITUTE FOR INFORMATION INDUSTRY   (Taiwan)

^c NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION METHODS; DATA ACQUISITION; TREES (MATHEMATICS); WIRELESS SENSOR NETWORKS;

NETWORK ROUTING PROBLEMS; TRANSMISSION STRUCTURE;

APPROXIMATION ALGORITHMS;

EID: 39349116074     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.173     Document Type: Conference Paper

References (14)

1. I. F. Akyildiz, S. Weilian, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks," Communications Magazine, IEEE, vol. 40, no. 8, pp. 102-114, 2002.
2. G. I. Pottie and W. I. Kaiser, "Wireless integrated network sensors," Commun. ACM, vol. 43, no. 5, pp. 51-58, 2000.
3. E. Mihaela, G. Ashish, G. Ramesh, and M. Rajeev, "Scale-free aggregation in sensor networks," Theor. Comput. Sci., vol. 344, no. 1, pp. 15-29, 2005.
4. A. Jindal and K. Psounis, "Modeling spatially-correlated sensor network data," in Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004. 2004 First Annual IEEE Communications Society Conference on, 2004, pp. 162-171.
5. L. Krishnamachari, D. Estrin, and S. Wicker, "The impact of data aggregation in wireless sensor networks," in Distributed Computing Systems Workshops, 2002. Proceedings. 22nd International Conference on, 2002, pp. 575-578.
6. R. Cristescu, B. Beferull-Lozano, M. Vetterli, and R. Wattenhofer, "Network correlated data gathering with explicit communication: Np-completeness and algorithms," Networking, IEEE/ACM Transactions on, vol. 14, no. 1, pp. 41-54, 2006.
7. R. Pascal von and W Roger, "Gathering correlated data in sensor networks," in Proceedings of the 2004 joint workshop on Foundations of mobile computing. Philadelphia, PA, USA: ACM Press, 2004.
8. G. Ashish and M. Kamesh, "Balancing steiner trees and shortest path trees online," 2000.
9. S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning trees and shortest-path trees," Algorithmica, vol. 14, no. 4, pp. 305-321, 1995.
10. A. Goel and D. Estrin, "Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk," Algorithmica, vol. 43, no. 1, pp. 5-15, 2005.
11. J. A. T. Thomas M. Cover, "Frontmatter and index," in Elements of Information Theory, 2001, pp. i-xxiii.
12. H.-C. Weng, E. H.-K. Wu, and G.-H. Chen, "Correlated data gathering with double trees in wireless sensor networks," submitted.
13. B. Awerbuch, "Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems," in Proceedings of the nineteenth annual ACM conference on Theory of computing. New York, New York, United States: ACM Press, 1987.
14. K. M. Chandy and I. Misra, "Distributed computation on graphs: shortest path algorithms," Commun. ACM, vol. 25, no. 11, pp. 833-837, 1982.