Network lifetime and power assignment in ad hoc wireless networks

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

Volumn 2832, Issue , 2003, Pages 114-126

  Calinescu, Gruia ^a   Kapoor, Sanjiv ^a   Olshevsky, Alexander ^b   Zelikovsky, Alexander ^c  

^a Illinois Institute of Technology   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; DYNAMIC PROGRAMMING; EFFICIENCY; GRAPH THEORY; LINEAR PROGRAMMING; TOPOLOGY; WIRELESS NETWORKS;

AD HOC WIRELESS NETWORKS; APPROXIMATION RATIOS; ASYMPTOTICALLY OPTIMAL; CONNECTIVITY CONSTRAINTS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DYNAMIC PROGRAMMING ALGORITHM; STRONG CONNECTIVITY; TRANSMISSION EFFICIENCY;

WIRELESS AD HOC NETWORKS;

EID: 0142214939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_13     Document Type: Article

References (22)

1. P. Wan, G. Calinescu, X.-Y. Li, and O. Frieder, "Minimum energy broadcast in static ad hoc wireless networks," Wireless Networks, 2002.
2. G. Calinescu, I. Mandoiu, and A. Zelikovsky, "Symmetric connectivity with minimum power consumption in radio networks," in Proc. 2nd IFIP International Conference on Theoretical Computer Science, (TCS 2002), R. Baeza-Yates and U. Montaniri and N. Santoro (eds.), Kluwer Academic Publ., August 2002, 119-130.
3. N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in Proceedings of FOCS, 1997.
4. D.-Z. D. M. Cardei, "Improving wireless sensor network lifetime through power aware organization," Submitted to ACM Wireless Networks.
5. S. Slijepcevic and M. Potkonjak, Power Efficient Organization of Wireless Sensor Networks, IEEE International Conference on Communications (ICC), Helsinki, June 2001, pp. 472-476.
6. G. Zussman and A. Segall, "Energy efficient routing in ad hoc disaster recovery networks," in IEEE INFOCOM'03, 2003.
7. F. Leighton and S.Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," Journal of the ACM, vol. 6, pp. 787-832, 1999.
8. W. Chen and N. Huang, "The strongly connecting problem on multihop packet radio networks," IEEE Transactions on Communications, vol. 37, pp. 293-295, 1989.
9. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, "Power consumption in packet radio networks," Theoretical Computer Science, vol. 243, pp. 289-305, 2000, preliminary version in STACS'97.
10. A. E. Clementi, P. Penna, and R. Silvestri, "On the power assignment problem in radio networks," Electronic Colloquium on Computational Complexity, vol. Report TR00-054, 2000, preliminary results in APPROX'99 and STAGS'2000.
11. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, "On the complexity of computing minimum energy consumption broadcast subgraphs," in 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010, 2001, pp. 121-131.
12. I. Caragiannis, C. Kaklamanis and P. Kanellopoulos, "New results for energy-efficient broadcasting in wireless networks," in ISAAC'2002, 2002, pp. 332-343.
13. E. Althaus, G. Calinescu, I. Mandoiu, S. Prasad, N. Tchervenski and A. Zelikovsky, "Power efficient range assignment in ad-hoc wireless networks," WCNC'03, 2003, pp. 1889-1894.
14. D. Blough, M. Leoncini, G. Resta, and P. Santi, "On the symmetric range assignment problem in wireless ad hoc networks," in 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002). Kluwer Academic Publishers, 2002, pp. 71-82.
15. A. Clementi, G. Huiban, P. Penna, G. Rossi, and Y. Verhoeven, "Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks," in Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), 2002.
16. U. Feige, "A threshold of In n for approximating set cover," Journal of the ACM, vol. 45, pp. 634-652, 1998.
17. P. Klein and R. Ravi, "A nearly best-possible approximation algorithm for nodeweighted steiner trees," Journal of Algorithms, vol. 19, pp. 104-115, 1995.
18. V. Chvatal, "A greedy heuristic for the set covering problem," Mathematics of Operation Research, vol. 4, pp. 233-235, 1979.
19. J. Könneman, "Personal communication."
20. S. Guha and S. Khuller, "Improved methods for approximating node weighted steiner trees and connected dominating sets," Information and Computation, vol. 150, pp. 57-74, 1999.
21. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979. Numerische Mathematik, vol. 1, pp. 269-271, 1960.
22. W. Liang, "Constructing Minimum-Energy Broadcast Trees in Wireless Ad Hoc Networks" MOBIHOC'02, 112-122, 2002.