On the construction of a maximum-lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1013-1021

  Wu, Yan ^a   Fahmy, Sonia ^a   Shroff, Ness B ^b  

^a PURDUE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER COMMUNICATIONS; INFOCOM; NETWORK LIFE-TIME;

APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; EFFICIENCY; ENERGY CONSERVATION; ENERGY EFFICIENCY; ITERATIVE METHODS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION EQUIPMENT; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 51349108846     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.80     Document Type: Conference Paper

References (26)

1. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, "Next Century Challenges: Scalable Coordination in Sensor Networks," in Proc. of MOBICOM, 1999.
2. J. Kahn, R. Katz, and K. Pister, "Next Century Challenges: Mobile Networking for "Smart Dust"," in Proc. of MOBICOM. 1999.
3. A. Mainwaring, J. Polastre, R. Szewczyk. D. Culler, and J. Anderson, "Wireless Sensor Networks for Habitat Monitoring," in Proc of WSNA, September 2002.
4. N. Xu, S. Rangwala, K. Chintalapudi, D. Ganesan, A. Broad, R. Govindan, and D. Estrin, "A Wireless Sensor Network for Structural Monitoring," in Proc. of SenSys, 2004.
5. L. Krishnamachari, D. Estrin, and S. Wicker, "Modeling Data-Centric Routing in Wireless Sensor Networks," in Proc. of INFOCOM, 2002.
6. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks," in Proc of MOBICOM, 2000.
7. K. Kalpakis, K. Dasgupta, and P. Namjoshi. "Maximum lifetime data gathering and aggregation in wireless sensor networks," in Proc of IEEE International Conference on Networking, 2002.
8. Y. T. Hou. Y. Shi, and H. D. Sherali, "Rate allocation in wireless sensor networks with network lifetime requirement," in Proc. of MOBI-HOC. 2004.
9. J. Gehrke and S. Madden, "Query Processing In Sensor Networks," Pervasive Computing, vol. 3. no. 1, pp. 46-55, 2004.
10. A. Woo, T. Tong. and D. Culler, "Taming the Underlying challenges of Reliable Multihop Routing in Sensor Networks." in Proc. of SenSys, 2003.
11. B. Hohlt. L. Doherty, and E. Brewer, "Flexible power scheduling for sensor networks," in Proc. of IPSN, 2004.
12. A. Goel and D. Estrin, "Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk," in Proc. of the ACM Symposium on Discrete Algorithms (SODA), 2003.
13. M. Enachescu, A. Goel, R. Govindan, and R. Motwani, "Scale free aggregation in sensor networks." in In Proc. of the First International Workshop on Algorithmic Aspects of Wireless Sensor Networks, 2004.
14. N. Thepvilojanapong, Y. Tobe, and K. Sezaki, "On the construction of efficient data gathering tree in wireless sensor networks," in Proc. of ISCAS, 2005.
15. Y. Zhang and Q. Huang. "A Learning-based Adaptive Routing Tree for Wireless Sensor Networks," Journal of Communications, vol. 1, no. 2, 2006.
16. M. Khan and G. Pandurangan. "A fast distributed approximation algorithm for minimum spanning trees," in Proc. of International Symposium on Distributed Computing, 2006.
17. G. Hackmann, C.-L. Fok, G.-C. Roman, and C. Lu, "Middleware support for seamless integration of sensor and IP networks," in Proc. of DCOSS, 2006.
18. S. Aims. J. Galbreath, A. Newhard, and C. Townsend, "Remotely reprogrammable sensors for structural health monitoring." in Structural Materials Technology conference, 2004.
19. P. Gupta and P. R. Kumar, "Critical Power for Asymptotic Connectivity in wireless Networks," Stochastic Analysis, Control, Optimizations, and Applications: A Volume in Honor of W. H. Fleming, 1998.
20. S. Shakkottai, R. Srikant, and N. Shroff, "Unreliable sensor grids: Coverage, connectivity and diameter," in Proc. of INFOCOM, 2003.
21. S. Kumar. T. H. Lai, and J. Balogh, "On k-Coverage in a mostly sleeping sensor network," in Proc of MOBICOM. September 2004.
22. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless Microsensor Networks," IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660-670, October 2002.
23. Y. Wu, S. Fahmy. and N. B. Shroff, "Energy efficient sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm," in Proc. of INFOCOM, May 2007.
24. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
25. M. Frer and B. Raghavachari, "Approximating the minimum-degree Steiner tree to within one of optimal." Journal of Algorithms, vol. 17, pp. 409-423, 1994.
26. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. McGraw-Hill, 2001.