A combinatorial algorithm for the maximum lifetime data gathering with aggregation problem in sensor networks

Computer Communications

Volumn 32, Issue 15, 2009, Pages 1655-1665

  Kalpakis, Konstantinos ^a   Tang, Shilang ^a  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

Author keywords

Combinatorial algorithms; Lifetime maximization; Linear programming; Wireless sensor networks

Indexed keywords

ASYMPTOTICALLY OPTIMAL; AVAILABLE ENERGY; COMBINATORIAL ALGORITHM; COMBINATORIAL ALGORITHMS; CRITICAL ISSUES; DATA GATHERING; IN-NETWORK AGGREGATION; INITIAL ENERGY; INTEGRAL SOLUTIONS; ITERATIVE ALGORITHM; LIFETIME DATA; LIFETIME MAXIMIZATION; NETWORK TOPOLOGY;

ALGORITHMS; COMBINATORIAL MATHEMATICS; DYNAMIC PROGRAMMING; ELECTRIC NETWORK TOPOLOGY; LINEARIZATION; OPTIMIZATION; ROUTING PROTOCOLS; SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 68049106089     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2009.06.007     Document Type: Article

References (40)

1. Akyildiz I.F., Su W., Sankarasubermanian Y., and Cayirici E. A survey of sensor networks. IEEE Communications Magazine 40 (2002) 102-114
2. B. Awerbuch, F.T. Leighton, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, in: Proc. ACM Symposium on Theory of Computing, 1994, pp. 487-496.
3. Bar-Yehuda R., Bendel K., Freund A., and Rawitz D. Local ratio: a unified framework for approximation algorithms. ACM Computing Surveys 36 4 (2004) 422-463
4. Bertsimas D., and Tsitsiklis J.N. Introduction to Linear Optimization (1997), Athena Scientific
5. BlueRadios, BR-C46AR Datasheet. Available from: .
6. CSR, BlueCore4 and BlueCore7 Datasheets. Available from: .
7. J.H. Chang, L. Tassiulas, Fast approximate algorithm for maximum lifetime routing in wireless ad-hoc networks, in: Networking 2000, volume LNCS 1815, 2000, pp. 702-713.
8. Chang J.-H., and Tassiulas L. Maximum lifetime routing in wireless sensor networks. IEEE/ACM Transactions on Networking 12 4 (2004) 609-619
9. K. Dasgupta, K. Kalpakis, P. Namjoshi, Improving the lifetime of sensor networks via intelligent selection of data aggregation trees, in: Proc. of the Communication Networks and Distributed Systems Modeling and Simulation Conference, Orlando, Florida, January 2003.
10. Deligiannakis A., Kotidis Y., and Roussopoulos N. Processing approximate aggregate queries in wireless sensor networks. Information Systems 31 8 (2006) 770-792
11. W.R. Heinzelman, A. Chandrakasan, H. Balakrishnan, Energy-efficient communication protocol for wireless microsensor networks, in Proc. of the 33rd Hawaii International Conference on System Sciences, 2000.
12. N. Garg, J. Konemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in: IEEE Symposium on Foundations of Computer Science, 1998, pp. 300-309.
13. M. Garofalakis, Processing Massive Data Streams. Invited full-day seminar at the 2008 VLDB Database School, Cairo University, Cairo, Egypt, March 2008. Available from: .
14. S.C.H. Huang, P. Wan, C.T. Vu, Y. Li, F. Yao, Nearly constant approximation for data aggregation scheduling in wireless sensor networks, in Proc. IEEE INFOCOM, 2007, pp. 366-372.
15. C. Intanagonwiwat, D. Estrin, R. Govindan, J. Heidemann, Impact of network density on data aggregation in wireless sensor networks, in: Proceedings of International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria, July 2002.
16. C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: Proc. of 6th ACM/IEEE Mobicom Conference, 2000.
17. J.M. Kahn, R.H. Katz, K.S.J. Pister, Mobile Networking for Smart Dust, in: Proc. of 5th ACM/IEEE Mobicom Conference, 1999.
18. Kalpakis K., Dasgupta K., and Namjoshi P. Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. Computer Networks 42 6 (2003) 697-716
19. Karl H., and Willig A. Protocols and Architectures for Wireless Sensor Networks (2005), John Wiley and Sons
20. Korte B., and Vygen J. Combinatorial Optimization: Theory and Algorithms (1991), Springer-Verlag
21. B. Krishanamachari, D. Estrin, S. Wicker, The impact of data aggregation in wireless sensor networks, in: International Workshop of Distributed Event Based Systems (DEBS), Vienna, Austria, July 2002.
22. J. Luo, J.-P. Hubaux, Joint mobility and routing for lifetime elongation in wireless sensor networks, in: Proc. of INFOCOM, 2005, pp. 1735-1746.
23. S. Madden, M.J. Franklin, J.M. Hellerstein, W. Hong, Tag: a tiny aggregation service for ad-hoc sensor networks, in: Proc. of 5th Symposium on Operating Systems Design and Implementation, 2002, p. 131.
24. S. Madden, R. Szewczyk, M.J. Franklin, D. Culler, Supporting aggregate queries over ad-hoc wireless sensor networks, in Proc. of 4th IEEE Workshop on Mobile Computing and Systems Applications, 2002.
25. R. Min, M. Bhardwaj, S. Cho, A. Sinha, E. Shih, A. Wang, A. Chandrakasan, Low-power wireless sensor networks, in: VLSI Design, 2001.
26. Nordic Semiconductor, nRF2401 Datasheet. Available from: .
27. Oikonomou K., and Stavrakakis I. An adaptive time-spread multiple-access policy for wireless sensor networks. EURASIP Journal on Wireless Communications and Networking 1 (2007) 24-32
28. Pan J., Cai L., Hou Y.T., Shi Y., and Shen S.X. Optimal base-station locations in two-tiered wireless sensor networks. IEEE Transactions on Mobile Computing 4 5 (2005) 458-473
29. J. Polastre, R. Szewczyk, D. Culler, Telos: enabling ultra-low power wireless research, in: Proc. of IPSN, 2005, pp. 364-369.
30. Puttagunta V., and Kalpakis K. Accuracy vs. lifetime: linear sketches for aggregate queries in sensor networks. Algorithmica 49 4 (2007) 357-385
31. J. Rabaey, J. Ammer, J. da Silva Jr., D. Patel, PicoRadio: ad-hoc wireless networking of ubiquitous low-energy sensor/monitor nodes, in: Proc. of the IEEE Computer Society Annual Workshop on VLSI, 2000.
32. N. Sadagopan, B. Krishnamachari, Maximizing data extraction in energy-limited sensor networks, in: Proc. of INFOCOM, 2004.
33. A. Sankar, Z. Liu, Maximum lifetime routing in wireless ad-hoc networks, in: Proc. of INFOCOM, 2004.
34. N. Shrivastava, C. Buragohain, D. Agrawal, S. Suri, Medians and beyond: new aggregation techniques for sensor networks, in: Proc. ACM SenSys, 2004.
35. J. Stanford, S. Tongngam, Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation, in: Proc. of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), Washington, DC, USA, 2006, pp. 273-277.
36. Tarjan R. Finding optimum branchings. Networks 7 1 (1977) 25-35
37. Tay Y.C., Jamieson K., and Balakrishnan H. Collision-minimizing CSMA and its applications to wireless sensor networks. IEEE Journal on Selected Areas in Communications 22 6 (2004) 1048-1057
38. Texas Instruments, Chipcon CC2420 Datasheet. Available from: .
39. Xue Y., Cui Y., and Nahrstedt K. Maximizing lifetime for data aggregation in wireless sensor networks. Mobile Networks and Applications 10 6 (2005) 853-864
40. Yu Y., Prasanna V.K., and Krishnamachari B. Energy minimization for real-time data gathering in wireless sensor networks. IEEE Transactions on Wireless Communications 5 11 (2006) 3087-3096