Work

Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up

Year: 2025

Type: conference-paper

Abstract: We study the wake-up problem in distributed networks, where an adversary awakens a subset of nodes at arbitrary times, and the goal is to wake up all other nodes as quickly as possible by sending only few messages. We prove the following lower bounds:

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733504

Authors: Peter Robinson, Ming Ming Tan

Institution: Augusta University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: National Science Foundation

Awards: Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation, CRII: AF: The Impact of Knowledge on the Performance of Distributed Algorithms