TY - GEN

T1 - Broadcasting in unreliable radio networks

AU - Kuhn, Fabian

AU - Lynch, Nancy

AU - Newport, Calvin

AU - Oshman, Rotem

AU - Richa, Andrea

N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Broadcast

KW - Dual graphs

KW - Unreliable networks

UR - http://www.scopus.com/inward/record.url?scp=77956254147&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956254147&partnerID=8YFLogxK

U2 - 10.1145/1835698.1835779

DO - 10.1145/1835698.1835779

M3 - Conference contribution

AN - SCOPUS:77956254147

SN - 9781605588889

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 336

EP - 345

BT - PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing

T2 - 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010

Y2 - 25 July 2010 through 28 July 2010

ER -