Energy-efficient wireless network design

Theory of Computing Systems

Volumn 39, Issue 5, 2006, Pages 593-617

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

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

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

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; COMMUNICATION; ENERGY UTILIZATION;

MULTICASTING;

EID: 33748559501     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1204-8     Document Type: Article

References (22)

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 Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '03), pp. 1889-1894. IEEE Computer Society Press, Alamitos, CA, 2003.
2. P. Berman and M. Karpinski. On Some Tighter Inapproximability Results. In Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP '99), pp. 200-209. LNCS 1644. Springer, Berlin, 1999.
3. G. Cǎlinescu, S. Kapoor, A. Olshevsky, and A. Zelikovsky. Network Lifetime and Power Assignment in Ad-Hoc Wireless Networks. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA '03), pp. 114-126. LNCS 2832. Springer, Berlin, 2003.
4. G. Cǎlinescu, I. Mǎndoiu, and A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp. 119-130, 2002.
5. I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. New Results for Energy-Efficient Broadcasting in Wireless Networks. In Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC '02), pp. 332-343. LNCS 2518. Springer, Berlin, 2002.
6. 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.
7. M. Chlebík and J. Chlebíková. Approximation Hardness of the Steiner Tree Problem on Graphs. In Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT '02), pp. 170-179. LNCS 2368. Springer, Berlin, 2002.
8. A. E. F. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS '01), pp. 121-131. LNCS 2010. Springer, Berlin, 2001.
9. A. E. F. Clementi, P. Penna, and R. Silvestri. Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In Proceedings of Randomization, Approximation, and Combinatorial Optimization (RANDOM/APPROX '99), pp. 197-208. LNCS 1671. Springer, Berlin, 1999.
10. J. Edmonds. Optimum Branchings. Journal of Research of the National Bureau of Standards, 71B:233-240, 1967.
11. M. X. Goemans and D. P. Williamson. A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing, 24:296-317, 1995.
12. 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.
13. M. Hajiaghayi, N. Immorlica, and V. Mirrokni. Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-Hop Networks. In Proceedings of the 9th ACM International Conference on Mobile Computing and Networking (MOBICOM '03), pp. 300-312, 2003.
14. E. Halperin and R. Krauthgamer. Poly logarithmic Inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC '03), pp. 585-594, 2003.
15. 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.
16. W. Liang. Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc. Networking and Computing (MOBIHOC '02), pp. 112-122, 2002.
17. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan, and S.S. Ravi. Algorithmic Aspects of Topology Control Problems for Ad hoc Networks. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC '02), pp. 123-134, 2002.
18. T. S. Rappaport. Wireless Communications: Principles and Practices. Prentice-Hall, Englewood Cliffs, NJ, 1996.
19. G. Robins and A. Zelikovsky. Improved Steiner Tree Approximations in Graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '00), pp. 770-779, 2000.
20. 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.
21. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides. On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In Proceedings of IEEE INFOCOM 2000, pp. 585-594, 2000.
22. L. Zosin and S. Khuller. On Directed Steiner Trees. In Proceedings of the 13th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA '02), pp. 59-63, 2002.