Minimum-power multicast routing in static ad hoc wireless networks

IEEE/ACM Transactions on Networking

Volumn 12, Issue 3, 2004, Pages 507-514

  Wan, Peng Jun ^a   Cǎlinescu, Gruia ^a   Yi, Chih Wei ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC WIRELESS NETWORKS; APPROXIMATION ALGORITHMS; MULTICAST ROUTING; STEINER TREE ALGORITHM;

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; HEURISTIC METHODS; MULTICASTING; POWER CONTROL; ROUTERS; THEOREM PROVING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 4344622572     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.828940     Document Type: Article

References (17)

1. D. Aldous and J. M. Steele, "Asymptotics for Euclidean minimal spanning trees on random points," Probabil. Theory Relat. Fields, vol. 92, pp. 247-258, 1992.
2. D. M. Blough, M. Leoncini, G. Resta, and P. Santi, "On the symmetric range assignment problem in wireless ad hoc networks," in Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, Montreal, QC, Canada, Aug. 2002, pp. 71-82.
3. G. Calinescu, I. Mandoiu, and A. Zelikovsky, "Symmetric connectivity with minimum power consumption in radio networks," in Proc. 2nd IFIP Int. Conf. Theoretical Computer Science, Montreal, QC, Canada, Aug. 2002, pp. 119-130.
4. W. T. Chen and N. F. Huang, "The strongly connecting problem on multihop packet radio networks," IEEE Trans. Commun., vol. 37, pp. 293-295, Oct. 1989.
5. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, and P. Vocca, "On the complexity of computing minimum energy consumption broadcast subgraphs," in Proc. 18th Annu. Symp. Theoretical Aspects of Computer Science, vol. LNCS 2010, 2001, pp. 121-132.
6. T. J. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: MIT Press and McGraw-Hill, 1990.
7. L. M. Feeney and M. Nilson, "Investigating the energy consumption of a wireless network interface in an ad hoc networking environment," in Proc. 20th IEEE INFOCOM, 2001, pp. 1548-1557.
8. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem. Amsterdam, The Netherlands: North-Holland, 1992.
9. A. O. Ivanov and A. A. Tuzhilin, Minimal Networks: The Steiner Problem and Its Generalizations. Cleveland, OH: CRC Press, 1994.
10. T. S. Rappaport, Wireless Communications: Principles and Practices. Englewood Cliffs, NJ: Prentice-Hall, 1996.
11. G. Robins and A. Zelikovsky, "Improved Steiner tree approximation in graphs," in Proc. ACM/SIAM Symp. Discrete Algorithms (SODA'2000), pp. 770-779.
12. S. Singh, C. S. Raghavendra, and J. Stepanek, "Power-aware broadcasting in mobile ad hoc networks," in Proc. IEEE PIMRC'99, Osaka, Japan, Sept. 1999, pp. 22-31.
13. J. M. Steele, "Growth rates of Euclidean minimal spanning trees with power weighted edges," Ann. Probabil., vol. 16, pp. 1767-1787, 1988.
14. H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Mathematica Japonica, vol. 24, pp. 573-577, 1980.
15. P.-J. Wan, G. Cǎlinescu, X.-Y. Li, and O. Frieder, "Minimum-energy broadcast in static ad hoc wireless networks," ACM Wireless Networks, vol. 8, no. 6, pp. 607-617, Nov. 2002.
16. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. 19th IEEE INFOCOM, 2000, pp. 585-594.
17. J. E. Yukich, "Asymptotics for weighted minimal spanning trees on random points," Stoch. Process. Appl., vol. 85, pp. 123-128, 2000.