Lifetime maximization for multicasting in energy-constrained wireless networks

IEEE Journal on Selected Areas in Communications

Volumn 23, Issue 1, 2005, Pages 117-125

  Floréen, Patrik ^a,b   Kaski, Petteri ^a,b   Kohonen, Jukka ^a,b   Orponen, Pekka ^a,b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b AALTO UNIVERSITY   (Finland)

Author keywords

Ad hoc networks; Computational complexity; Energy awareness; Lifetime; Multicasting; Optimization

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MULTICASTING; OPTIMIZATION; POLYNOMIALS; TELECOMMUNICATION NETWORKS;

AD HOC NETWORKS; ENERGY-AWARENESS; LIFETIME; STATIC ASSIGNMENT;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 11844305982     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2004.837342     Document Type: Conference Paper

References (40)

1. M. Ilyas, The Handbook of Ad Hoc Wireless Networks. Boca Raton, FL: CRC Press, 2003.
2. C. E. Perkins, Ad Hoc Networking. Reading, MA: Addison-Wesley, 2001.
3. I. Stojmenović, Handbook of Wireless Networks and Mobile Computing. New York: Wiley, 2002.
4. R. Rajaraman, "Topology control and routing in ad hoc networks: a survey," ACM SIGACT News, vol. 33, no. 2, pp. 60-73, Jun. 2002.
5. Q. Li, J. Aslam, and D. Rus, "Online power-aware routing in wireless ad-hoc networks," in Proc. 7th Annu. Int. Conf. Mobile Comput. Netw. (MOBICOM 2001), 2001, pp. 97-107.
6. S. Singh, M. Woo, and C. S. Raghavendra, "Power-aware routing in mobile ad hoc networks," in Proc. 4th Annu. Int. Conf. Mobile Comput. Netw., 1998, pp. 181-190.
7. G. Calinescu, S. Kapoor, A. Olhevsky, and A. Zelikovsky, "Network lifetime and power assignment in ad-hoc wireless networks," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2003, vol. 2832, Proc. 11th Annu. Eur. Symp. Algorithms, pp. 114-126.
8. E. L. Lloyd, R. Liu, M. V. Marathe, R. Ramanathan, and S. S. Ravi, "Algorithmic aspects of topology control problems for ad hoc networks," in Proc. 3rd ACM Int. Symp. Mobile Ad Hoc Netw. Comput., 2002, pp. 123-134.
9. R. J. Marks II, A. K. Das, M. El-Sharkawi, P. Arabshahi, and A. Gray, "Maximizing lifetime in an energy constrained wireless sensor array using team optimization of cooperating systems," in Proc. IEEE Int. Joint Conf. Neural Netw., 2002, pp. 371-376.
10. I. Kang and R. Poovendran, "Maximizing static network lifetime of wireless broadcast ad hoc networks," in Proc. IEEE Int. Conf. Commun., pp. 2256-2261.
11. B. Wang and S. K. S. Gupta, "Extending the lifetime of multicast trees in WANETs," J. Inf. Sci. Eng., vol. 20, pp. 425-447, 2004.
12. R. Ramanathan and R. Rosales-Hain, "Topology control of multihop wireless networks using transmit power adjustment," in Proc. 19th Annu. Joint Conf. IEEE Comput. Commun. Soc., 2000, pp. 404-413.
13. T. S. Rappaport, Wireless Communications: Principles & Practice. Upper Saddle River, NJ: Prentice-Hall, 1996.
14. M. Čagalj, J.-P. Hubaux, and C. Enz, "Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues," in Proc. 8th Annu. Int. Conf. Mobile Comput. Netw., 2002, pp. 172-182.
15. I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos, "A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem," Inf. Process. Lett., vol. 86, pp. 149-154, 2003.
16. A. E. F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, "On the complexity of computing minimum energy consumption broadcast subgraphs," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2001, vol. 2010, Proc. 18th Symp. Theor. Aspects Comput. Sci., pp. 121-131.
17. A. K. Das, R. J. Marks, M. El-Sharkawi, P. Arabshahi, and A. Gray, "Minimum power broadcast trees for wireless networks: Integer programming formulations," in Proc. 22nd Annu. Joint Conf. IEEE Comput. Commun. Soc., 2003, pp. 1001-1010.
18. W. Liang, "Constructing minimum-energy broadcast trees in wireless ad hoc networks," in Proc. 3rd ACM Int. Symp. Mobile Ad Hoc Netw. Comput., 2002, pp. 112-122.
19. R. J. Marks, II, A. K. Das, M. El-Sharkawi, P. Arabshahi, and A. Gray, "Minimum power broadcast trees for wireless networks: Optimizing using the viability lemma," in Proc. IEEE Int. Symp. Circuits Syst., vol. 1, 2002, pp. 273-276.
20. I. Papadimitriou and L. Georgiadis, "Energy-aware broadcasting in wireless networks," in Proc. WiOPT'03: Modeling Opt. Mobile, Ad Hoc Wireless Netw., 2003, pp. 267-277.
21. P.-J. Wan, G. Cǎlinescu, X.-Y. Li, and O. Frieder, "Minimum-energy broadcasting in static ad hoc wireless networks," Wireless Netw., vol. 8, pp. 607-617, 2002.
22. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. 19th Annu. Joint Conf. IEEE Comput. Commun. Soc., 2000, pp. 585-594.
23. _, "Algorithms for energy-efficient multicasting in static ad hoc wireless networks," Mobile Netw. Appl., vol. 6, pp. 251-263, 2001.
24. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, "Power consumption in packet radio networks." Theor. Comput. Sci., vol. 243, pp. 289-305, 2000.
25. V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks," IEEE J. Sel. Areas Commun., vol. 17, pp. 1333-1344, Aug. 1999.
26. J.-H. Chang and L. Tassiulas, "Energy conserving routing in wireless ad hoc networks," in Proc. 19th Annu. Joint Conf. IEEE Comput. Commun. Soc., 2000, pp. 22-31.
27. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "Resource management in energy-limited, bandwidth-limited, transceiver limited wireless networks for session-based multicasting," Comput. Netw., vol. 39, pp. 113-131, 2002.
28. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Berlin, Germany: Springer-Verlag, 1999.
29. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed Steiner problems," J. Algorithms, vol. 33, pp. 73-91, 1999.
30. E. Halperin and R. Krauthgamer, "Polylogarithmic inapproximability," in Proc. 35th ACM Symp. Theory Comput., 2003, pp. 585-594.
31. P. Floréen, P. Kaski, J. Kohonen, and P. Orponen, "Multicast time maximization in energy constrained wireless networks," in Proc. 2003 Joint Workshop Found. Mobile Comput. (DIALM-POMC'03), 2003, pp. 50-58.
32. S. O. Krumke, R. Liu, E. L. Lloyd, M. V. Marathe, R. Ramanathan, and S. S. Ravi, "Some Preliminary results on maximizing lifetimes of ad hoc networks," Comput. Sci. Dept., Univ. Albany-State Univ. New York, Tech. Rep. SUNYA-CS-03-04, Aug. 2003.
33. M. Adler and C. Scheideler, "Efficient communication strategies for ad hoc wireless networks," Theory Comput. Syst., vol. 33, pp. 337-391, 2000.
34. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 2nd ed. Berlin, Germany: Springer-Verlag, 1993.
35. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
36. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing Steiner trees," in Proc. 14th ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 266-274.
37. N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proc. 39th Annu. Symp. Found. Comput. Sci., 1998, pp. 300-309.
38. J. Cheriyan and M. R. Salavatipour, "Hardness and approximation results for packing Steiner trees problems," in Proc. 12th Annu. Eur. Symp. Algorithms, 2004, pp. 180-191.
39. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
40. D. B. Yudin and A. S. Nemirovskii, "Informational complexity and effective methods for the solution of convex extremal problems" (in Russian), Ékonomika i Matematicheskie Metody, vol. 12, pp. 357-369, 1976.