A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem

Information Processing Letters

Volumn 86, Issue 3, 2003, Pages 149-154

  Caragiannis, Ioannis ^a   Kaklamanis, Christos ^a   Kanellopoulos, Panagiotis ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Approximation algorithms; Graph algorithms; Wireless networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; ENERGY UTILIZATION; GRAPH THEORY; SET THEORY; WIRELESS TELECOMMUNICATION SYSTEMS;

LOGARITHMIC APPROXIMATION;

PROBLEM SOLVING;

EID: 0037449039     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00484-2     Document Type: Article

References (12)

1. Cǎlinescu G., Mǎndoiu I., Zelikovsky A. Symmetric connectivity with minimum power consumption in radio networks. Proc. 2nd IFIP International Conference on Theoretical Computer Science. 2002;119-130.
2. Clementi A.E.F., Crescenzi P., Penna P., Rossi G., Vocca P. On the complexity of computing minimum energy consumption broadcast subgraphs. Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS'01). Lecture Notes in Comput. Sci. 2010:2001;121-131 Springer, Berlin. Revised version as: A worst-case analysis of an MST-based heuristic to construct energy-efficient broadcast trees in wireless networks, Technical Report 010, University of Rome "Tor Vergata", 2001.
3. Clementi A.E.F., Crescenzi P., Penna P., Rossi G., Vocca P. On the complexity of computing minimum energy consumption broadcast subgraphs. Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS'01). Lecture Notes in Comput. Sci. 2010:2001;121-131 Springer, Berlin. Revised version as: A worst-case analysis of an MST-based heuristic to construct energy-efficient broadcast trees in wireless networks, Technical Report 010, University of Rome "Tor Vergata", 2001.
4. Clementi A.E.F., Huiban G., Penna P., Rossi G., Vocca P. Some recent theoretical advances and open questions on energy consumption in static ad hoc wireless networks. Proc. 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE'02). 2002;23-38.
5. Clementi A.E.F., Penna P., Silvestri R. Hardness results for the power range assignment problem in packet radio networks. Proc. of Randomization, Approximation, and Combinatorial Optimization (RANDOM/APPROX'99). Lecture Notes in Comput. Sci. 1671:1999;197-208 Springer, Berlin.
6. Goemans M.X., Williamson D.P. The primal-dual method for approximation algorithms and its application to network design problems. Hochbaum D. Approximation Algorithms. 1997;PWS Publishing Company, Warsaw.
7. Guha S., Khuller S. Approximation algorithms for connected dominating sets. Algorithmica. 20:(4):1998;374-387.
8. Guha S., Khuller S. Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inform. and Comput. 150:(1):1999;57-74.
9. Kirousis L.M., Kranakis E., Krizanc D., Pelc A. Power consumption in packet radio networks. Theoret. Comput. Sci. 243:(1-2):2000;289-305.
10. Rappaport T.S. Wireless Communications: Principles and Practices. 1996;Prentice-Hall, Englewood Cliffs, NJ.
11. Wan P.-J., Cǎlinescu G., Li X.-Y., Frieder O. Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks. 8:(6):2002;607-617.
12. Wieselthier J.E., Nguyen G.D., Ephremides A. On the construction of energy-efficient broadcast and multicast trees in wireless networks. Proc. of IEEE INFOCOM. 2000;585-594.