The Wake‐Up Problem in MultiHop Radio Networks
From MaRDI portal
Recommendations
Cited in
(27)- Design patterns in beeping algorithms: examples, emulation, and analysis
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Efficient and competitive broadcast in multi-channel radio networks
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
- Leader election in multi-hop radio networks
- Contention resolution in a non-synchronized multiple access channel
- Deterministic and energy-optimal wireless synchronization
- Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
- scientific article; zbMATH DE number 1979528 (Why is no real title available?)
- Deterministic communication in radio networks
- Contention resolution with constant throughput and log-logstar channel accesses
- Efficient symmetry breaking in multi-channel radio networks
- Deterministic blind radio networks
- Coordination Problems in Ad Hoc Radio Networks
- The wake-up problem in multi-hop radio networks
- A better wake-up in radio networks
- Improved lower bound for deterministic broadcasting in radio networks
- Automata, Languages and Programming
- The wake up dominating set problem
- The wake up dominating set problem
- scientific article; zbMATH DE number 7774270 (Why is no real title available?)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
- Contention resolution with message deadlines
- Jamming-resistant backoff with polylogarithmic sending and listening cost
- Energy efficient alert in single-hop networks of extremely weak devices
- Scalable wake-up of multi-channel single-hop radio networks
This page was built for publication: The Wake‐Up Problem in MultiHop Radio Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422495)