The Wake‐Up Problem in MultiHop Radio Networks

DOI10.1137/S0097539704442726zbMath1124.68005OpenAlexW1984355228MaRDI QIDQ5422495

Dariusz R. Kowalski, Marek Chrobak, Leszek Gąsieniec

Publication date: 22 October 2007

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539704442726

zbMATH Keywords

probabilistic methodgossipingbroadcastingwake-upRadio network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items

Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Deterministic Communication in Radio Networks ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Energy efficient alert in single-hop networks of extremely weak devices ⋮ Unnamed Item ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Leader election in multi-hop radio networks ⋮ Efficient and competitive broadcast in multi-channel radio networks

This page was built for publication: The Wake‐Up Problem in MultiHop Radio Networks