Exponential Separations in the Energy Complexity of Leader Election

DOI10.1145/3341111zbMath1454.68015OpenAlexW2979827763WikidataQ115522533 ScholiaQ115522533MaRDI QIDQ4973045

Yi-Jun Chang, Wei Zhan, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang

Publication date: 2 December 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

wireless networkleader electionenergy complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (7)

Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Node and edge averaged complexities of local graph problems ⋮ Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics ⋮ Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks ⋮ Distributed MIS in O(log log n) Awake Complexity ⋮ Transmitting once to elect a leader on wireless networks ⋮ Efficient and competitive broadcast in multi-channel radio networks

This page was built for publication: Exponential Separations in the Energy Complexity of Leader Election