Broadcasting in unreliable radio networks

Fabian Kuhn, Nancy Lynch, Calvin Newport, Rotem Oshman, Andrea Richa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

43 Scopus citations

Abstract

Practitioners agree that unreliable links, which sometimes deliver messages and sometime do not, are an important characteristic of wireless networks. In contrast, most theoretical models of radio networks fix a static set of links and assume that these links work reliably throughout an execution. This gap between theory and practice motivates us to investigate how unreliable links affect theoretical bounds on broadcast in radio networks. To that end we consider a model that includes two types of links: reliable links, which always deliver messages, and unreliable links, which sometimes fail to deliver messages. We assume that the reliable links induce a connected graph, and that unreliable links are controlled by a worst-case adversary. In the new model we show an Ω(n log n) lower bound on deterministic broadcast in undirected graphs, even when all processes are initially awake and have collision detection, and an Ω(n) lower bound on randomized broadcast in undirected networks of constant diameter. This separates the new model from the classical, reliable model. On the positive side, we give two algorithms that tolerate unreliability: an O(n3/2√log n)-time deterministic algorithm and a randomized algorithm which terminates in O(n log2 n) rounds with high probability.

Original languageEnglish (US)
Title of host publicationPODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing
Pages336-345
Number of pages10
DOIs
StatePublished - 2010
Event29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 - Zurich, Switzerland
Duration: Jul 25 2010Jul 28 2010

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010
CountrySwitzerland
CityZurich
Period7/25/107/28/10

Keywords

  • Broadcast
  • Dual graphs
  • Unreliable networks

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Broadcasting in unreliable radio networks'. Together they form a unique fingerprint.

Cite this