The Energy Complexity of Broadcast

DOI10.1145/3212734.3212774zbMath1428.68061arXiv1710.01800OpenAlexW2963550269MaRDI QIDQ5197671

Thomas P. Hayes, Yi-Jun Chang, Qizheng He, Seth Pettie, Wenzheng Li, Varsha Dani

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

wireless networkdistributed algorithmbroadcastenergy-aware computing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (12)

Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ Energy-efficient distributed algorithms for synchronous networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs ⋮ Distributed MIS in O(log log n) Awake Complexity ⋮ Distributed MIS with Low Energy and Time Complexities ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Exactly optimal deterministic radio broadcasting with collision detection ⋮ Efficient and competitive broadcast in multi-channel radio networks

This page was built for publication: The Energy Complexity of Broadcast