Near Optimal Leader Election in Multi-Hop Radio Networks

DOI10.1137/1.9781611973105.54zbMath1421.68006arXiv1210.8439OpenAlexW2952144494WikidataQ57379935 ScholiaQ57379935MaRDI QIDQ5741762

Mohsen Ghaffari, Bernhard Haeupler

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.8439

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (15)

Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Randomized broadcast in radio networks with collision detection ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Optimal Message-Passing with Noisy Beeps ⋮ Deterministic Communication in Radio Networks ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Edge motion and the distinguishing index ⋮ Transmitting once to elect a leader on wireless networks ⋮ Unnamed Item ⋮ Global synchronization and consensus using beeps in a fault-prone multiple access channel ⋮ How many cooks spoil the soup? ⋮ Leader election in multi-hop radio networks ⋮ Exactly optimal deterministic radio broadcasting with collision detection ⋮ Noisy beeping networks ⋮ Precise bounds for the distinguishing index of the Cartesian product

This page was built for publication: Near Optimal Leader Election in Multi-Hop Radio Networks