Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

@article{Czumaj2017ExploitingST,
  title={Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks},
  author={Artur Czumaj and Peter Davies},
  journal={Proceedings of the ACM Symposium on Principles of Distributed Computing},
  year={2017}
}
  • A. CzumajPeter Davies
  • Published 6 March 2017
  • Computer Science
  • Proceedings of the ACM Symposium on Principles of Distributed Computing
We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision detection mechanisms. It has been known for almost 20 years that in undirected networks with n nodes and diameter D, randomized broadcasting requires Ω(D log t n/D + log2n) rounds in expectation, assuming that uninformed nodes are not allowed to communicate (until they are informed). Only very recently, Haeupler and… 
View on ACM
[PDF] Semantic Reader
20 Citations
Background Citations
10
Methods Citations
2
Results Citations
2

20 Citations

Brief Announcement: Broadcast in Radio Networks, Time vs. Energy Tradeoffs

It is proved that two new randomized energy-efficient algorithms are almost time-optimal for given energy limits for graphs with constant diameters by constructing lower bound on time of Ω(n^1/φ . φ).

Fast and Resource Competitive Broadcast in Multi-channel Radio Networks

This paper has identified an efficient "epidemic broadcast" scheme in the multi-channel setting that is robust against jamming, and devised variants for both MultiCast and MultiCastAdv that can work in networks in which only C channels are available, for any C≥1.

Finding the Size of a Radio Network with Short Labels

The task of size discovery is considered: finding the size of an unknown radio network with collision detection, and the main result states that the minimum length of such a labeling scheme is Θ(loglogΔ).

Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization

This work adapts the broadcast and leader election algorithm of Czumaj and Davies to achieve a running-time parametrized by the independence number of the network, which preserves the running time on general graphs, matching the best known, but also improves running times to near-optimality across a wide range of geometric-based graph classes.

Randomized Communication Without Network Knowledge

This work presents the first \emph{randomized} broadcasting algorithms for blind networks in which nodes have no prior knowledge whatsoever, and demonstrates that lack of parameter knowledge can be overcome at only a small increase in running time.

Brief Announcement: Resource Competitive Broadcast against Adaptive Adversary in Multi-channel Radio Networks

This work uses "epidemic broadcast" with proper working probabilities to achieve time efficiency and resource competitiveness, and leverage coupling arguments in the analysis to handle the adaptivity of the adversary.

Deterministic Leader Election in Anonymous Radio Networks

This work designs a centralized decision algorithm, working in polynomial time, whose input is a configuration and which decides if the configuration is feasible and provides a dedicated deterministic distributed leader election algorithm for each feasible configuration.

Deterministic Leader Election in Anonymous Radio Networks

This work designs a centralized decision algorithm, working in polynomial time, whose input is a configuration and which decides if the configuration is feasible, and provides a dedicated deterministic distributed leader election algorithm for each feasible configuration.

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

It turns out that the optimal length of labeling schemes for both problems depends on the maximum degree Δ of the graph, and it is proved that topology recognition in the class of arbitrary radio networks requires labeling schemes of length Ω(logΔ).

The Energy Complexity of Broadcast

This paper investigates the energy complexity of fundamental communication primitives such as Broadcast in multi-hop radio networks, and shows that it is possible to achieve near optimality in time complexity with only poly logn energy cost.

23 References

Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks

An algorithm which operates on undirected radio networks with collision detection and elects a leader in O(D + log n) expected time is presented, which is the fastest leader election algorithm to achieve a high-probability bound therein.

Near Optimal Leader Election in Multi-Hop Radio Networks

The results break the simulation barrier for leader election in this paper and essentially remove the logarithmic slowdown over the broadcast time TBC, preventing optimal algorithms.

Broadcasting algorithms in radio networks with unknown topology

  • A. CzumajW. Rytter
  • Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
An optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log/sup 2/n), with high probability is described, and a deterministic oblivious algorithm is described that completes broadcasting in almost optimal time O(n log/Sup 2/D).

Deterministic Communication in Radio Networks

A new deterministic algorithm for the fundamental problem of broadcasting, running in O(n*log(D)*log(log((D*Delta)/n))) time, which is the fastest known algorithm for this problems and has direct implications on the fastest deterministic leader election and clock synchronization algorithms in both directed and undirected radio networks.

Deterministic broadcasting in ad hoc radio networks

For the model with collision detection, efficient algorithms for broadcasting and for acknowledged broadcasting in strongly connected graphs are developed and it is shown that broadcasting with acknowledgement is not possible in this model at all.

Leader election in multi-hop radio networks

Deterministic broadcasting in unknown radio networks

This work considers the problem of distributed deterministic broadcasting in radio networks of unknown topology and size, and develops a linear-time broadcasting algorithm for symmetric graphs, which is optimal and develops efficient algorithms for broadcasting and for acknowledged broadcasting in strongly connected graphs.

On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization

Distributed broadcast in radio networks of unknown topology

Electing a Leader in Multi-hop Radio Networks

This work considers the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks, and shows how to perform gossiping with combined messages in \(\mathcal{O}(n\log^{3/2} n \sqrt{\log\log n})\) time by a deterministic algorithm, and in expected time by an randomized algorithm.