skip to main content
10.1145/1400751.1400827acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
demonstration

A tradeoff analysis on message complexity and lifetime optimality for a distributed multicast algorithm in WSNs

Published: 18 August 2008 Publication History

Abstract

We consider the lifetime maximization for multicast in wireless sensor networks (WSNs) and propose a new distributed algorithm that achieves a good balance on algorithm optimality and message complexity.

References

[1]
Kang, I. and Poovendran, R., 2003. Maximizing static network lifetime of wireless broadcast adhoc networks. In Proceedings of the IEEE ICC, Alaska, 2003, 2256 --2261.
[2]
Das, A. K., Marks, R. J., et al, 2003. MDLT: a polynomial time optimal algorithm for maximization of time-to-first-failure in energy-constrained broadcast wireless networks. In Proceedings of the IEEE Globecom, 2003, 362 -- 366.
[3]
Georgiadis, L., 2003. Bottleneck multicast trees in linear time. IEEE Communications Letters, 7(11), 2003, 564 -- 566.
[4]
Guo, S., Leung, V. and Yang, O., 2006. Distributed multicast algorithms for lifetime maximization in wireless ad hoc networks with omnidirectional and directional antennas. In Proceedings of the IEEE Globecom, 2006.

Index Terms

  1. A tradeoff analysis on message complexity and lifetime optimality for a distributed multicast algorithm in WSNs

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
        August 2008
        474 pages
        ISBN:9781595939890
        DOI:10.1145/1400751
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 18 August 2008

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. approximation algorithm
        2. multicast
        3. wireless sensor networks

        Qualifiers

        • Demonstration

        Conference

        PODC '08

        Acceptance Rates

        Overall Acceptance Rate 740 of 2,477 submissions, 30%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 170
          Total Downloads
        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 17 Jan 2025

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media