Energy-efficient wireless network design

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 585-594

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

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; ENERGY EFFICIENCY; ENERGY UTILIZATION; MULTICASTING; WIRELESS NETWORKS;

AD HOC WIRELESS NETWORKS; ALL-TO-ALL COMMUNICATION; COMMUNICATION PATTERN; ENERGY EFFICIENT WIRELESS NETWORKS; INAPPROXIMABILITY; SCARCE RESOURCES; TOTAL ENERGY CONSUMPTION; WIRELESS NETWORK DESIGN;

WIRELESS AD HOC NETWORKS;

EID: 35248882028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_60     Document Type: Article

References (17)

1. E. Althaus, G. Cǎlinescu, I. Mǎndoiu, S. Prasad, N. Tchervenski, and A. Zelikovsky. Power Efficient Range Assignment in Ad-Hoc Wireless Networks. In Proc. of the IEEE Wireless Communications and Networking Conference (WCNC '03), IEEE Computer Society Press, pp. 1889-1894, 2003.
2. P. Berman and M. Karpinski. On Some Tighter Inapproximability Results. In Proc. of the 26th International Colloquium on Automata, Languages, and Programming (ICALP '99), LNCS 1644, Springer, pp. 200-209, 1999.
3. G. Cǎlinescu, S. Kapoor, A. Olshevsky and A. Zelikovsky. Network Lifetime and Power Assignment in Ad-Hoc Wireless Networks. In Proc. of the 11th Annual European Symposium on Algorithms (ESA '03), 2003, to appear.
4. I. Caragiannis, C. Kaklamanis and P. Kanellopoulos. New Results for Energy-Efficient Broadcasting in Wireless Networks. In Proc. of the 13th Annual International Symposium on Algorithms and Computation (ISAAC '02), LNCS 2518, Springer, pp. 332-343, 2002.
5. M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha and M. Li. Approximation Algorithms for Directed Steiner Problems. Journal of Algorithms, 33(1):73-91, 1999.
6. M. Chlebík and J. Chlebíková. Approximation Hardness of the Steiner Tree Problem on Graphs. In Proc of the 8th Scandinavian Workshop on Algorithm Theory (SWAT '02), LNCS 2368, Springer, pp. 170-179, 2002.
7. A. E. F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast : Subgraphs. In Proc. of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STAGS '01), LNCS 2010, Springer, pp. 121-131, 2001.
8. A. E. F. Clementi, P. Penna, and R. Silvestri. Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In Proc. of Randomization, Approximation, and Combinatorial Optimization (RANDOM/APPROX '99), LNCS 1671, Springer, pp. 197-208, 1999.
9. J. Edmonds. Optimum Branchings. Journal of Research of the National Bureau of Standards, 71B:233-240, 1967.
10. M. X. Goemans and D. P. Williamson. A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing, 24:296-317, 1995.
11. S. Guha and S. Khuller. Improved Methods for Approximating. Node-Weighted Steiner Trees and Connected Dominating Sets. Information and Computation, 150(1):57-74, 1999.
12. E. Halperin and R. Krauthgamer. Polylogarithmic Inapproximability. In Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC '03), pp. 585-594, 2003.
13. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power Consumption in Packet Radio Networks. Theoretical Computer Science, 243(1-2):289-305, 2000.
14. W. Liang. Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In Proc. of 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC '02), pp. 112-122, 2002.
15. G. Robins and A. Zelikovsky. Improved Steiner Tree Approximations in Graphs. In Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '00), pp. 770-779, 2000.
16. P.-J. Wan, G. Cǎlinescu, X.-Y. Li, and O. Frieder. Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks, 8(6):607-617, 2002.
17. L. Zosin and S. Khuller. On Directed Steiner Trees. In Proc. of the 13th Annual ACM/SIAM Symposium on Discrete. Algorithms (SODA '02), pp. 59-63, 2002.