Collaborative Broadcast in O(log log n) Rounds

06/12/2019
by   Christian Schindelhauer, et al.
0

We consider the multihop broadcasting problem for n nodes placed uniformly at random in a disk and investigate the number of hops required to transmit a signal from the central node to all other nodes under three communication models: Unit-Disk-Graph (UDG), Signal-to-Noise-Ratio (SNR), and the wave superposition model of multiple input/single output (MISO). In the MISO model, informed nodes cooperate to produce a stronger superposed signal. We do not consider the problem of transmitting a full message nor do we consider interference. In each round, the informed senders try to deliver to other nodes the required signal strength such that the received signal can be distinguished from the noise. We assume either sufficiently high node density ρ= Ω( n) or some Ω( n) initially informed nodes uniformly distributed with ρ = Ω(1) in order to launch the broadcasting process. In the unit-disk graph model, broadcasting needs O(√(n/ρ)) rounds. In the other models, we use an Expanding Disk Broadcasting Algorithm, where in a round only triggered nodes within a certain distance from the initiator node contribute to the broadcasting operation. This algorithm achieves a broadcast in only O( n/ρ) rounds in the SNR-model. Adapted to the MISO model, it broadcasts within O( n - ρ) rounds. All bounds are asymptotically tight and hold with high probability, i.e. 1- n^-O(1).

READ FULL TEXT

page 12

page 13

research
12/31/2017

Pull and Push&Pull in Random Evolving Graphs

The Push, the Pull and the Push&Pull algorithms are well-studied rumor s...
research
03/01/2020

Distributed Testing of Graph Isomorphism in the CONGEST model

In this paper we study the problem of testing graph isomorphism (GI) in ...
research
04/19/2023

Coloring Fast with Broadcasts

We present an O(log^3log n)-round distributed algorithm for the (Δ+1)-co...
research
09/12/2020

Terminating cases of flooding

Basic synchronous flooding proceeds in rounds. Given a finite undirected...
research
02/25/2020

Analysis of Amnesiac Flooding

The purpose of the broadcast operation in distributed systems is to spre...
research
03/27/2023

Optimal Message-Passing with Noisy Beeps

Beeping models are models for networks of weak devices, such as sensor n...
research
08/01/2019

Distributed Data Summarization in Well-Connected Networks

We study distributed algorithms for some fundamental problems in data su...

Please sign up or login with your details

Forgot password? Click here to reset