Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation

Proc. - Seventh ACIS Int. Conf. on Software Eng., Artific. Intelligence, Netw., and Parallel/Distributed Comput., SNPD 2006, including Second ACIS Int. Worshop on SAWN 2006

Volumn 2006, Issue , 2006, Pages 273-277

  Stanford, Jeffrey ^a   Tongngam, Sutep ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DATA AGGREGATION; WIRELESS SENSOR NETWORKS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTER NETWORKS; COMPUTER SIMULATION; HEURISTIC METHODS; POLYNOMIALS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33845579641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SNPD-SAWN.2006.22     Document Type: Conference Paper

References (16)

1. K. Kalpakis, K. Dasgupta, and P. Namjoshi, "Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks," Computer Networks:The international journal of computer and telecommunications networking, vol. 42-6, pp. 697-716, August 2003. [Online]. Available: citeseer.ist.psu.edu/kalpakis02efficient.html
2. N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in IEEE Symposium on Foundations of Computer Science, 1998, pp. 300-309. [Online]. Available: citeseer.nj.nec.com/garg97faster.html
3. M. Bhardwaj and A. Chandrakasan, "Bounding the lifetime of sensor networks via optimal role assignments," in IEEE INFOCOM, 2002. [Online]. Available: citeseer.ist.psu.edu/article/bhardwaj02bounding.html
4. K. Dasgupta, K. Kalpakis, and P. Namjoshi, "An efficient clustering-based heuristic for data gathering and aggregation in sensor networks," in IEEE Wireless Communications and Networking Conference (WCNC), 2003. [Online], Available: citeseer.ist.psu.edu/575548.html
5. _, "Improving the lifetime of sensor networks via intelligent selection of data aggregation trees," in Communications Networks and Distributed Systems Modeling and Simulation Conference, 2003. [Online]. Available: citeseer.ist.psu.edu/dasgupta03improving.html
6. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy- efficient routing protocols for wireless microsensor networks," in Proc. Hawaii Int. Conf. on System Sciences, Jan., 2000.
7. S. Lindsey and C. Raghavendra, "Pegasis:power-efficient gathering in sensor information systems," in IEEE Aerospace Conference, March 2002.
8. H. Tan and I. Korpeoglu, "Power efficient data gathering and aggregation," SIGMOD Rec. V.32, 4, pp. 66-71, 2003. [Online]. Available: citeseer.ist.psu.edu/732677.html
9. P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky, "Power efficient monitoring management in sensor networks," in Proc. IEEE Wireless Communications and Networking Conference, 2004.
10. H. Liu, P.-J. Wan, C.-W. Yi, X. Jia, S. Makki, and P. Niki, "Maximal lifetime scheduling in sensor surveillance networks," in INFOCOM, 2005.
11. D. Brinza, G. Calinescu, S. Tongngam, and A. Zelikovsky, "Energy-efficient continuous and event-driven monitoring," in Mobile Adhoc and Sensor Systems (MASS), 2005.
12. N. Sadagopan and B. Krishnamachari, "Maximizing data extraction in energy-limited sensor networks," in INFOCOM, 2004.
13. Y. Xue, Y. Cui, and K. Nahrstedt, "Maximizing lifetime for data aggregation in wireless sensor networks," Mobile Networks and Applications, vol. 10(6), pp. 853-864, 2005.
14. J. Edmonds, "Optimum branchings," Research of the National Bureau of Standards, vol. 71B, pp. 233-240, 1967.
15. Y. Chu and T. Liu, "On the shortest arborescence of a directed graph," Science Sinica, vol. 14, pp. 1396-1400, 1965.
16. R. Tarjan, "Finding optimum branchings," Networks, vol. 7, pp. 25-35, 1977.