skip to main content
10.1145/1544012.1544046acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

High-throughput, reliable multicast without "crying babies" in wireless mesh networks

Published: 09 December 2008 Publication History

Abstract

There are two primary challenges to supporting high-throughput, reliable multicast in wireless mesh networks (WMNs). The first is no different from unicast: wireless links are inherently lossy due to varying channel conditions and interference. The second, known as the "crying baby" problem, is unique to multicast: the multicast source may have varying throughput to different multicast receivers, and hence trying to satisfy the reliability requirement for poorly connected receivers can potentially result in performance degradation for the rest of the receivers.
In this paper, we propose Pacifier, a new high-throughput reliable multicast protocol. Pacifier seamlessly integrates four building blocks, namely, tree-based opportunistic routing, intra-flow network coding, source rate limiting, and round-robin batching, to support high-throughput, reliable multicast routing in WMNs, while at the same time effectively addresses the "crying baby" problem.

References

[1]
S. Chachulski, M. Jennings, S. Katti, and D. Katabi. Trading structure for randomness in wireless opportunistic routing. In ACM SIGCOMM, 2007.
[2]
H. W. Holbrook, S. K. Singhal, and D. R. Cheriton. Log-based receiver-reliable multicast for distributed interactive simulation. In Proc. of ACM SIGCOMM, 1995.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference
December 2008
526 pages
ISBN:9781605582108
DOI:10.1145/1544012
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: 09 December 2008

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media