On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 2591-2595

  Kuo, Tung Wei ^a   Tsai, Ming Jer ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC OPERATION; COMPUTATION COSTS; DATA AGGREGATION TREE; DATA GATHERING; ENERGY COST; MINIMUM ENERGY COSTS; NP COMPLETE; NP-COMPLETENESS; RELAY NODE; ROUTING STRUCTURES; ROUTING TABLE; TOTAL ENERGY;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; DATA COMMUNICATION SYSTEMS; FORESTRY; SENSORS;

TREES (MATHEMATICS);

ALGORITHMS; COMMUNICATION; COMPUTATION; COSTS; DATA PROCESSING; SENSORS; SIMULATION;

EID: 84861610789     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195659     Document Type: Conference Paper

References (18)

1. C. Liu and G. Cao, "Distributed monitoring and aggregation in wireless sensor networks," in IEEE INFOCOM, 2010.
2. A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, "Wireless sensor networks for habitat monitoring," in ACM WSNA, 2002.
3. N. Xu, S. Rangwala, K. K. Chintalapudi, D. Ganesan, A. Broad, R. Govindan, and D. Estrin, "A wireless sensor network for structural monitoring," in ACM SenSys, 2004.
4. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE Journal on Selected Areas in Communications, vol. 23, pp. 755-764, 2005.
5. D. Luo, X. Zhu, X. Wu, and G. Chen, "Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks," in IEEE INFOCOM, 2011.
6. Y. Wu, S. Fahmy, and N. B. Shroff, "On the construction of a maximum-lifetime data gathering tree in sensor networks: NP-Completeness and approximation algorithm," in IEEE INFOCOM, 2008.
7. A. Goel and D. Estrin, "Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk," in SODA, 2003.
8. C. Park and P. H. Chou, "Ambimax: Autonomous energy harvesting platform for multi-supply wireless sensor nodes," in IEEE SECON, 2006.
9. X. Jiang, J. Polastre, and D. Culler, "Perpetual environmentally powered sensor networks," in IPSN, 2005.
10. C. P. Low, "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs," Information Processing Letters, vol. 100, pp. 154-161, 2006.
11. T.-W. Kuo and M.-J. Tsai. On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms. [Online]. Available: http://nms.citi.sinica.edu.tw/ twkuo/ARP.pdf
12. M.-J. Tsai, H.-Y. Yang, and W.-Q. Huang, "Axis-based virtual coordinate assignment protocol and delivery-guaranteed routing protocol in wireless sensor networks," in IEEE INFOCOM, 2007.
13. F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian, "Approximating the single-sink link-installation problem in network design," SIAM J. on Optimization, vol. 11, pp. 595-610, 2000.
14. R. Hassin, R. Ravi, and F. S. Salman, "Approximation algorithms for a capacitated network design problem," Algorithmica, vol. 38, pp. 417-431, 2004.
15. S. Khuller, B. Raghavachari, and N. Young, "Balancing minimum spanning trees and shortest-path trees," Algorithmica, vol. 14, pp. 305-321, 1995.
16. G. Robins and A. Zelikovsky, "Improved steiner tree approximation in graphs," in SODA, 2000.
17. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for steiner trees," Acta Informatica, vol. 15, pp. 141-145, 1981.
18. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," in ACM MobiCom, 2000.