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

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:

Authors

Institutions

Publication Details

Published
2025-06-13
DOI
https://doi.org/10.1145/3732772.3733504
Primary Topic
Advanced Malware Detection Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Ming Ming Tan, Peter Robinson
Advanced Malware Detection Techniques
article

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

Ming Ming Tan, Peter Robinson
article en

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:

Augusta University (US)
National Science Foundation
Openalex Percentile: Top 85%
Advanced Malware Detection Techniques
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Brief Announcement: Rise and Shine Efficiently! The Complexity of Adversarial Wake-up — Ming Ming Tan, Peter Robinson · (2025) | TGRS Research Map | TGRS