Exponential separations in the energy complexity of leader election

DOI10.1145/3055399.3055481zbMath1369.68049arXiv1609.08486OpenAlexW2555333713MaRDI QIDQ4978022

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

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed computingcollision detectionleader electionenergy efficiencyapproximate counting

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (8)

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 with Low Energy and Time Complexities ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds

This page was built for publication: Exponential separations in the energy complexity of leader election