skip to main content
research-article

Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing

Published:27 March 2008Publication History
Skip Abstract Section

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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bonabeau, E., Dorigo, M., and Theraulaz, G. 1999. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle Scholar
  4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms, Second Edition. The MIT Press, Cambridge. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle Scholar
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. Kompella, V., Pasquale, J., and Polyzos, G. 1993a. Multicast routing for multimedia communication. IEEE Trans. Netw. 1, 3 (June), 286--292. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle Scholar
  9. Liang, W. 2006. Approximate minimum-energy multicasting in wireless ad hoc networks. IEEE Trans. Mobile Comput. 5, 4 (April), 377--387. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle Scholar
  12. Prehofer, C. and Bettstetter, C. 2005. Self-organization in communication networks: principles and design paradigms. IEEE Comm. Mag. 43, 7 (July), 78--85. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle Scholar
  15. Wi, S. and Choi, Y. 1995. A delay constrained distributed multicast routing algorithm. In 12th International Conference on Computer Communication (ICCC). 833--838. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle ScholarCross RefCross Ref
  18. 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 ScholarGoogle Scholar

Index Terms

  1. Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Autonomous and Adaptive Systems
      ACM Transactions on Autonomous and Adaptive Systems  Volume 3, Issue 1
      March 2008
      118 pages
      ISSN:1556-4665
      EISSN:1556-4703
      DOI:10.1145/1342171
      Issue’s Table of Contents

      Copyright © 2008 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 27 March 2008
      • Accepted: 1 November 2007
      • Revised: 1 July 2007
      • Received: 1 December 2006
      Published in taas Volume 3, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!