Round Robin is optimal for fault-tolerant broadcasting on wireless networks

Clementi, Andrea E. F.; Monti, Angelo; Silvestri, Riccardo

doi:10.1016/j.jpdc.2003.09.002

Cited by 57 publications

(52 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Others have considered models with probabilistic message corruption [7,8]. Wireless networks with crash failures (but not Byzantine failures) have also been studied extensively in both single hop (e.g., [9,10]) and multihop (e.g., [11,12]) contexts. By contrast, we consider a malicious adversary that can choose to send a message in any round, potentially destroying honest messages or overwhelming them with malicious data.…”

Section: Related Workmentioning

confidence: 99%

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks

Gilbert¹,

Guerraoui

Newport³

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

How efficiently can a malicious device disrupt a single-hop wireless network? Imagine two honest players attempting to exchange information in the presence of a malicious adversary that can disrupt communication by jamming or overwriting messages. Assume the adversary has a broadcast budget of β-unknown to the honest players. We show that communication can be delayed for 2β + Θ(lg |V |) rounds, where V is the set of values that the honest players may transmit. We then derivevia reduction to this 3-player game-round complexity lower bounds for several classical n-player problems: 2β + Ω(lg |V |) for reliable broadcast, 2β + Ω(log n) for leader election, and 2β + Ω(k lg |V |/k) for static k-selection. We also consider an extension of our adversary model that includes up to t crash failures. Here we show a bound of 2β + Θ(t) rounds for binary consensus. We provide tight, or nearly tight, upper bounds for all four problems. From these results we can derive bounds on the efficiency of malicious disruption, stated in terms of two new metrics: jamming gain (the ratio of rounds delayed to adversarial broadcasts) and disruption-free complexity (the rounds required to terminate in the special case of no disruption). Two key conclusions of this study: (1) all the problems considered feature semantic vulnerabilities that allow an adversary to disrupt termination more efficiently than simple jamming (i.e., all have a jamming gain greater than 1); and (2) for all the problems considered, the round complexity grows linearly with the number of bits to be communicated (i.e., all have a Ω(lg |V |) or Ω(lg n) disruption-free complexity.)

show abstract

Section: Related Workmentioning

confidence: 99%

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks

Gilbert¹,

Guerraoui

Newport³

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Chlamtac and Kutten [5] opened the topic by proving the calculation of optimal broadcast schedules to be NP-hard, Chlamtac and Weinstein [6] followed with a polynomial-time algorithm that guaranteed schedule lengths of size O(D log 2 n), and Alon et al proved the existence of constant diameter graphs that require Ω(log 2 n) rounds [2]. An oft-cited paper by Bar Yehuda et al [3] introduced the first distributed solution to broadcast, launching a long series of papers investigating distributed solutions under different model assumptions; c.f., [7][8][9][10]21]. The algorithm in [3] assumes no topology knowledge or collision detection, and solves broadcast in O((D + log n) log (n)) rounds, w.h.p.…”

mentioning

confidence: 99%

Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast

Gilbert

Khabbazian

Newport³

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper addresses two primary questions: (i) How much faster can we disseminate information in a large wireless network if we have multiple communication channels available (as compared to relying on only a single communication channel)? (ii) Can we still disseminate information reliably, even if some subset of the channels are disrupted? In answer to the first question, we reduce the cost of broadcast to O(log log n) rounds/hop, approximately, for sufficiently many channels. We answer the second question in the affirmative, presenting two different algorithms, while at the same time proving a lower bound showing that disrupted channels have unavoidable costs.In more detail, we present upper and lower bounds for the multihop broadcast problem in the tdisrupted radio network model. This model assumes that in every round: each processes can participate on 1 out of C available communication channels, of which up to t < C might be locally disrupted, preventing communication. This model captures the unpredictable message loss that plagues real radio networks. We begin by studying the case with no disruption (t = 0) and present a randomized algorithm that solves broadcast in O((D + log n)(log C + log n C ) rounds, w.h.p., where D is the network diameter and n is the network size. Notice, for a single channel (C = 1), our algorithm has the same running time as the canonical Bar-Yehuda et al. algorithm [3], but as the number of channels increases so does our algorithm's performance advantage. We then prove that for a sufficiently large number of channels, our algorithm is within a O(log log n) factor of optimal.Having shown that multiple channels yield efficiency, we next turn our attention to showing that they also yield robustness. We now consider a setting with adversarial disruption (t > 0) and a common source of randomness. We present a randomized algorithm that solves broadcast in O((D + log n)( C log C log log C C−t + log n C−t )) rounds. For t up to a constant factor of C, this algorithm performs only a factor of O(log log C) slower than the no disruption case: that is, even with significant disruption, our multi-channel algorithm still outperforms solutions that assume a single, perfectly reliable channel. For completeness, we conclude by considering the case with disruption and no common randomness. We demonstrate a clear separation with the common randomness case by proving a lower bound of Ω((D +log n) Ct C−t ) rounds, and then presenting an almost matching randomized upper bound that solves broadcast in O((D + log n) Ct C−t log ( n t )) rounds, w.h.p.

show abstract

“…For local broadcast, a slight tweak to the strategy of [2] provides a local broadcast solution the runs in O(log n log ∆) rounds [8]. The dual graph model was introduced by Clementi et al [5], where it was called the dynamic fault model. We independently reintroduced the model in [11] with the dual graph name.…”

Section: Related Workmentioning

confidence: 99%

“…Notice, this bound matches the well-known solution of Bar-Yehuda et al [2] in the protocol model. In fact, our new upper bound is based on the classic result 5 We can always solve broadcast among 2β nodes in (2β) 2 rounds by doing round robin broadcast 2β times.…”

Section: Global Broadcast Upper Boundmentioning

confidence: 99%

The cost of radio network broadcast for different models of unreliable links

Ghaffari

Lynch

Newport

2013

Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

We study upper and lower bounds for the global and local broadcast problems in the dual graph model combined with different strength adversaries. The dual graph model is a generalization of the standard graph-based radio network model that includes unreliable links controlled by an adversary. It is motivated by the ubiquity of unreliable links in real wireless networks. Existing results in this model [11,12,3,8] assume an offline adaptive adversary-the strongest type of adversary considered in standard randomized analysis. In this paper, we study the two other standard types of adversaries: online adaptive and oblivious. Our goal is to find a model that captures the unpredictable behavior of real networks while still allowing for efficient broadcast solutions.For the online adaptive dual graph model, we prove a lower bound that shows the existence of constant-diameter graphs in which both types of broadcast require Ω(n/ log n) rounds, for network size n. This result is within log-factors of the (near) tight upper bound for the offline adaptive setting. For the oblivious dual graph model, we describe a global broadcast algorithm that solves the problem in O(D log n + log 2 n) rounds for network diameter D, but prove a lower bound of Ω( √ n/ log n) rounds for local broadcast in this same setting. Finally, under the assumption of geographic constraints on the network graph, we describe a local broadcast algorithm that requires only O(log 2 n log ∆) rounds in the oblivious model, for maximum degree ∆. In addition to the theoretical interest of these results, we argue that the oblivious model (with geographic constraints) captures enough behavior of real networks to render our efficient algorithms useful for real deployments.

show abstract

Round Robin is optimal for fault-tolerant broadcasting on wireless networks

Cited by 57 publications

References 12 publications

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks

Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast

The cost of radio network broadcast for different models of unreliable links

Contact Info

Product

Resources

About