Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks

DOI10.1007/s00446-022-00426-warXiv2104.09096OpenAlexW3154275390MaRDI QIDQ6096038

Varsha Dani, Seth Pettie, Unnamed Author, Thomas P. Hayes

Publication date: 11 September 2023

Published in: Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmsmaximal matchingsensor networksradio networksenergy-aware computation

Mathematics Subject Classification ID

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

Related Items (2)

Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks

Cites Work

• Unnamed Item
• Unnamed Item
• On matching cover of graphs
• On the distributed complexity of the semi-matching problem
• Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Small maximal matchings in random graphs.
• Linear-Time Approximation for Maximum Weight Matching
• Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses
• Exponential Separations in the Energy Complexity of Leader Election
• Efficient algorithms for leader election in radio networks
• Maximal independent sets in radio networks
• The Energy Complexity of Broadcast
• Semi-matchings for bipartite graphs and load balancing
• Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
• The Energy Complexity of BFS in Radio Networks

This page was built for publication: Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks