Abstract
The minimum-energy multicast tree problem aims to construct a multicast tree rooted at the source node and spanning all the destination nodes such that the sum of transmission power at non-leaf nodes is minimized. However, aggressive power assignment at non-leaf nodes, although conserving more energy, results in multicast trees that suffer from higher hop count and jeopardizes delay-sensitive applications, signifying a clear tradeoff between energy efficiency and delay. This article formulates these issues as a constrained Steiner tree problem, and describes a distributed constrained Steiner tree algorithm, which jointly conserves energy and bounds delay for multicast routing in ad hoc networks. In particular, the proposed algorithm concurrently constructs a constrained Steiner tree, performs transmission power assignment at non-leaf nodes, and strives to minimize the sum of transmission power of non-leaf nodes, subject to the given maximum hop count constraint. Simulation results validate the effectiveness and reveal the characteristics of the proposed algorithm.
- Bae, S., Lee, S., Su, W., and Gerla, M. 2000. The design, implementation, and performance evaluation of the on-demand multicast routing protocol in multihop wireless networks. IEEE Netw. Special Issue on Multicasting Empowering the Next Generation Internet 14, 1 (Jan./Feb.), 70--77. Google Scholar
Digital Library
- Bonabeau, E., Dorigo, M., and Theraulaz, G. 1999. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York. Google Scholar
Digital Library
- Cartigny, J., Simplot, D., and Stojmenovic, I. 2003. Localized minimum-energy broadcasting in ad hoc networks. In Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM 2003). San Francisco, CA.Google Scholar
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms, Second Edition. The MIT Press, Cambridge. Google Scholar
Digital Library
- Gosavi, S., Das, S., Vaze, S., Singh, G., and Buehler, E. 2003. Obtaining subtrees from graphs: an ant colony approach. In Swarm Intelligence Symposium. Indianapolis, IN.Google Scholar
- Huang, T.-L. and Lee, D. T. 2002. A distributed multicast routing algorithm for real-time applications in wide area networks. In Proceedings of the International Symposium of Parallel Architectures, Algorithms and Networks (ISPAN), 335--340. Google Scholar
Digital Library
- Kompella, V., Pasquale, J., and Polyzos, G. 1993a. Multicast routing for multimedia communication. IEEE Trans. Netw. 1, 3 (June), 286--292. Google Scholar
Digital Library
- Kompella, V., Pasquale, J., and Polyzos, G. 1993b. Two distributed algorithms for multicasting multimedia information. In 2nd International Conference on Computer Communication (ICCC). 343--349.Google Scholar
- Liang, W. 2006. Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Trans. Mobile Comput. 5, 4 (April), 377--387. Google Scholar
Digital Library
- Lun, D. S., Ratnakar, N., Medard, M., Koetter, R., Karger, D. R., Ho, T., Ahmed, E., and Zhao, F. 2006. Minimum-cost multicast over coded packet networks. IEEE Trans. Info. Theory 52, 6 (June), 2608--2623. Google Scholar
Digital Library
- Pan, D., Mavinjurve, P., Ngo, H. Q., Verma, V., and Chandak, A. 2004. DMIP3S: distributed algorithms for power-conserving multicasting in static wireless ad hoc networks. In IEEE Workshop on High Performance Switching and Routing (HPSR). Phoenix, Arizona, 236--240.Google Scholar
- Prehofer, C. and Bettstetter, C. 2005. Self-organization in communication networks: principles and design paradigms. IEEE Comm. Mag. 43, 7 (July), 78--85. Google Scholar
Digital Library
- Shen, C.-C. and Jaikaeo, C. 2005. Ad hoc multicast routing algorithm with swarm intelligence. ACM Mobile Netw. Appl. J. 10, 1--2 (Feb.), 47--59. Google Scholar
Digital Library
- Singh, G., Das, S., Gosavi, S., and Pujar, S. 2004. Ant colony algorithms for Steiner trees: an application to routing in sensor networks. In Recent Developments in Biologically Inspired Computing, L. N. de Castro and F. J. von Zuben, Eds. Idea Group Inc., Chapter 6.Google Scholar
- Wi, S. and Choi, Y. 1995. A delay constrained distributed multicast routing algorithm. In 12th International Conference on Computer Communication (ICCC). 833--838. Google Scholar
Digital Library
- Wieselthier, J. E., Nguyen, G. D., and Ephremides, A. 2002. Energy-efficient broadcast and multicast trees in wireless Networks. Mobile Netw. Appl. 7, 6 (Dec.), 481--492. Google Scholar
Digital Library
- Wu, Y., Chou, P. A., and Kung, S.-Y. 2005. Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Trans. Comm. 53, 11 (Nov.), 1906--1918.Google Scholar
Cross Ref
- Yi, Y., Lee, S.-J., Su, W., and Gerla, M. 2002. On-demand multicast routing protocol (ODMRP) for ad hoc networks. http://www.ietf.org/proceedings/02nov/I-D/draft-ietf-manet-odmrp-04.txt.Google Scholar
Index Terms
Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing
Recommendations
Energy-efficient broadcast and multicast routing in multihop ad hoc wireless networks: Research Articles
Special Issue on Ad Hoc Wireless NetworksThis paper addresses the problem of broadcasting and multicasting in large scale multihop ad hoc wireless networks. We focus on the energy-efficient broadcast routing in stationary networks and consider the case where wireless nodes can dynamically ...
Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing
The delay and delay variation-bounded Steiner tree problem is an important multicast routing issue in real-time multimedia networks. Such a constrained Steiner tree problem is known to be NP-complete. In this paper, we propose a distributed multicast ...
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
The delay and delay variation-bounded Steiner tree problem is an important problem in real-time multimedia networks, and is known to be NP-complete. In this paper, we propose an efficient heuristic multicast routing algorithm based on simulated ...






Comments