☆ 4.3 Article

The energy complexity of diameter and minimum cut computation in bounded-genus networks

THEORETICAL COMPUTER SCIENCE (2024)

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

Varsha Dani et al.

Summary: In designing wireless network algorithms, reducing energy usage while maintaining network performance is important. This study proposes a distributed randomized algorithm for solving the matching problem and an algorithm for data backup assignment in case of node failure. Experimental results show that these algorithms perform well in terms of energy consumption and time complexity, meeting the practical requirements.

DISTRIBUTED COMPUTING (2023)

添加到收藏夹

Article Computer Science, Theory & Methods

Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election

Yi-Jun Chang et al.

Summary: This paper discusses the energy complexity of the leader election problem in the single-hop radio network model and presents new algorithms and bounds to improve existing algorithms. It provides optimal deterministic energy complexity for both dense and sparse instances.

ACM TRANSACTIONS ON ALGORITHMS (2023)

添加到收藏夹

Article Computer Science, Hardware & Architecture