May 16, 2024 · In this model, nodes have the ability to decide on which round they are awake, and on which round they are sleeping. Two (adjacent) nodes can ...

Sep 9, 2024 · In distributed network computing, a variant of the LOCAL model has been recently introduced, referred to as the SLEEPING model.

May 16, 2024 · This paper presents a distributed coloring algorithm for the SLEEPING model, which aims to minimize energy consumption in distributed systems.

In this paper we provide a deterministic scheme for solving any decidable problem in the distributed sleeping model. The sleeping model [22, 9] is a�...

Article "Distributed Coloring in the SLEEPING Model" Detailed information of the J-GLOBAL is an information service managed by the Japan Science and ...

In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algo- rithm ...

Dec 22, 2023 · Distributed coloring in sparse graphs with fewer colors (PODC 2018). ... The sleeping LOCAL model is a variation of the LOCAL model, where the.

In this paper we provide a deterministic scheme for solving any decidable problem in the distributed sleeping model. The sleeping model [22, ...

Jul 31, 2020 · Our main result is that we show that MIS can be solved in (expected) O(1) rounds under node-averaged awake complexity measure in the sleeping model.