Efficient algorithms for leader election in radio networks

DOI10.1145/571825.571833zbMath1292.68013OpenAlexW2087596759MaRDI QIDQ5170865

Tomasz Jurdziński, Mirosław Kutyłowski, J. Zatopiański

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/571825.571833

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (22)

Performing work in broadcast networks ⋮ Leader election in ad hoc radio networks: a keen ear helps ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Node and edge averaged complexities of local graph problems ⋮ Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks ⋮ Restrained medium access control on adversarial shared channels ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ Distributed MIS in O(log log n) Awake Complexity ⋮ Distributed MIS with Low Energy and Time Complexities ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Randomized mutual exclusion on a multiple access channel ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Impact of knowledge on election time in anonymous networks ⋮ Ordered and delayed adversaries and how to work against them on a shared channel ⋮ Transmitting once to elect a leader on wireless networks ⋮ Topology recognition and leader election in colored networks ⋮ Message and time efficient multi-broadcast schemes ⋮ Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards ⋮ Local queuing under contention

This page was built for publication: Efficient algorithms for leader election in radio networks