Optimal relay location for resource-limited energy-efficient wireless communication

Journal of Global Optimization

Volumn 36, Issue 3, 2006, Pages 391-399

  Cardei, Ionut ^a   Cardei, Mihaela ^a   Wang, Lusheng ^b   Xu, Baogang ^c   Du, Ding Zhu ^d  

^a Florida Atlantic University   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c NANJING NORMAL UNIVERSITY   (China)

^d The University of Texas at Dallas   (United States)

Author keywords

Approximation algorithms; Bottleneck Steiner tree; Power efficient; Steiner tree; Wireless networks

Indexed keywords

CIVIL DEFENSE; ELECTRIC BATTERIES; ENERGY EFFICIENCY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION; TRANSMITTERS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; BOTTLENECK STEINER TREES; POWER EFFICIENT; STEINER TREES; WIRELESS NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33748307498     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9017-0     Document Type: Article

References (11)

1. Chen, D., Du, D.-Z., Hu, X., Lin, G., Wang, L., Xue, G.: Approximations for Steiner trees with minimum number of Steiner points. J. Global Optim. 18, 17-33 (2000)
2. Chang, J.-H., Tassiulas, L.: Fast approximate algorithms for maximum lifetime routing in wireless ad-hoc networks. Lecture Notes in Computer Science, 1815 pp. 702-713 Springer (2000)
3. Chang, J.-H., Tassiulas, L.: Energy conserving routing in wireless ad-hoc networks. Proceedings of the 19th Annual IEEE Infocom Conference (2000)
4. Chiang, C., Sarrafzadeh, M., Wong, C.K.: A powerful global router: based on Steiner min-max tree. IEEE Trans. Comput.-Aided Desig 19, 1318-1325 (1990)
5. Lin, G., Xue, G.: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inform. Process. Lett. 69:53-57 (1999)
6. Li, Q., Aslam, J., Rus, D.: Online power-aware routing in wireless ad-hoc networks. Proceedings of ACM SIGMOBILE, pp. 97-107 (2001)
7. Prömel, H.J., Steger, A.: A new approximation algorithm for the steiner tree problem with performance ratio 5/3. J. Algor. 36, 89-101 (2000)
8. Sarrafzadeh, M., Wong, C.K.: Bottleneck Steiner trees in the plane. IEEE Trans. Comput. 41:370-374 (1992)
9. Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. IEEE International Conference on Communications (ICC), June 2001, Helsinki, Finland
10. Wang, L., Du, D.-Z. : Approximations for a Bottleneck Steiner Tree Problem. Algorithmica 32:554-561 (2002)
11. Wang, L., Li, Z.: An approximation algorithm for a Bottleneck Steiner Tree Problem in the Euclidean plane. Inform. Process. Lett. 81:151-156 (2002)