Minimum-energy all-to-all multicasting in wireless ad hoc networks

IEEE Transactions on Wireless Communications

Volumn 8, Issue 11, 2009, Pages 5490-5499

  Liang, Weifa ^a   Brent, Richard ^a   Xu, Yinlong ^b   Wang, Qingshan ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

All to all multicasting; Approximation algorithm; Energy conservation; Energy consumption optimization; Routing algorithms; Wireless ad hoc networks

Indexed keywords

ALL-TO-ALL MULTICASTING; APPROXIMATION RATIOS; BATTERY LIFETIME; DISTRIBUTED IMPLEMENTATION; ENERGY CONSUMPTION OPTIMIZATION; ENERGY EFFICIENT OPERATIONS; ENERGY EFFICIENT ROUTING; FUNDAMENTAL OPERATIONS; MOBILE NODES; MULTICAST SESSIONS; MULTICAST TREE; NP COMPLETE; TERMINAL NODES; TOTAL ENERGY CONSUMPTION; TRANSMISSION POWER;

AD HOC NETWORKS; ELECTRIC LOAD FORECASTING; ENERGY CONSERVATION; ENERGY EFFICIENCY; INTELLIGENT AGENTS; MULTICASTING; NETWORK PERFORMANCE; ROUTING ALGORITHMS; SYSTEMS ENGINEERING; WIRELESS AD HOC NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 70749092760     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2009.070602     Document Type: Article

References (15)

1. A. Ballardie, "Core based trees (CBT) multicasting routing architecture," Internet RFC 2201, 1997.
2. M. Cagalj, J.-P. Hubaux, and C. Enz, "Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues," Proc. MobiCom'02, ACM, 2002.
3. M. Cagalj, J.-P. Hubaux, and C. Enz, "Minimum-energy broadcast in all-wireless networks," Wireless Networks, vol.11, pp. 177-188, 2005.
4. K. M. Chandy and J. Misra, "Distributed computation on graphs: shortest path algorithms," Commun. ACM, vol.25, pp. 833-837, 1982.
5. C. C. Chiang, M. Gerla, and L. Zhang, "Adaptive shared tree multicast in mobile wireless networks," in Proc. IEEE Globecom, pp. 1817-1822, 1998.
6. M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman, 1979.
7. L. Ji and M. Corson, "A lightweight adaptive multicast algorithm," in Proc. IEEE Globecom, pp. 1036-1042, 1998.
8. P. N. Klein and R. Ravi, "A nearly best-possible approximation algorithm for node-weighted Steiner trees," J. Algorithms, vol.19, pp. 104- 114, 1995.
9. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol.15, pp. 141-145, 1981.
10. W. Liang, "Constructing minimum-energy broadcast trees in wireless ad hoc networks," in Proc. MOBIHOC'02, ACM, pp. 112-122, 2002.
11. W. Liang, "Approximate minimum-energy multicasting in wireless ad hoc networks," IEEE Trans. Mobile Computing, vol.5, pp. 377-387, 2006.
12. V. Park and M. Corson, Temporally-Ordered Routing Algorithm (TORA) Version 1, functional specification, Internet Draft, draft-ietfmanet- tora-spec-00.txt, 1997.
13. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. IEEE INFOCOM'00, 2000.
14. J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "Energy- efficient broadcast and multicast trees in wireless networks," Mobile Networks and Applications, vol.7, pp. 481-492, 2002.
15. C. W. Wu, Y. C. Tay, and C.-K. Toh, Ad hoc multicast routing protocol utilizing increasing id-numberS (AMRIS), functional specification, Internet draft, 1998.