The Energy Complexity of BFS in Radio Networks

DOI10.1145/3382734.3405713MaRDI QIDQ5855245zbMATH OpenOpenAlexFDO

Authors Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Seth Pettie

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed computingenergy-aware computinggraph algorithmsradio networkssensor networks

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cited in

(14)

• Efficient and competitive broadcast in multi-channel radio networks
• scientific article; zbMATH DE number 2089983 (Why is no real title available?)
• 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
• 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
• 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
• Brief announcement: Low-distortion clustering in bounded growth graphs
• A near-optimal low-energy deterministic distributed SSSP with ramifications on congestion and APSP
• Distributed MIS in O( n) awake complexity

This page was built for publication: The Energy Complexity of BFS in Radio Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855245)