Centralized Communication in Radio Networks with Strong Interference

Galčík, František

doi:10.1007/978-3-540-69355-0_23

Cited by 3 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Explicit-interference models Several works (e.g., [15,16]) model a network using two graphs, a transmission graph and an interference graph . It is typically assumed that ⊆ .…”

Section: Other Modelsmentioning

confidence: 99%

Broadcasting in unreliable radio networks

Kühn

Lynch

Newport

et al. 2010

Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

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 Ω( log ) lower bound on deterministic broadcast in undirected graphs, even when all processes are initially awake and have collision detection, and an Ω( ) 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 ( 3/2 √ log )-time deterministic algorithm and a randomized algorithm which terminates in ( log 2 ) rounds with high probability.

show abstract

“…Explicit-interference models Several works (e.g., [15,16]) model a network using two graphs, a transmission graph and an interference graph . It is typically assumed that ⊆ .…”

Section: Other Modelsmentioning

confidence: 99%