The wakeup problem in synchronous broadcast systems
From MaRDI portal
Recommendations
Cited in
(30)- Many-to-many communication in radio networks
- Design patterns in beeping algorithms: examples, emulation, and analysis
- Activating anonymous ad hoc radio networks
- Contention resolution on a fading channel
- Efficient and competitive broadcast in multi-channel radio networks
- Global synchronization and consensus using beeps in a fault-prone multiple access channel
- Performing work in broadcast networks
- Broadcasting in UDG radio networks with unknown topology
- Contention resolution in a non-synchronized multiple access channel
- Adversarial multiple access channels with individual injection rates
- Time-efficient broadcast in radio networks
- Fast Radio Broadcasting with Advice
- Unbounded contention resolution in multiple-access channels
- Deterministic blind radio networks
- Local queuing under contention
- Deterministic broadcasting in ad hoc radio networks
- The wake up and report problem is time-equivalent to the firing squad synchronization problem
- The wakeup problem in synchronous broadcast systems (extended abstract)
- Randomized mutual exclusion on a multiple access channel
- Coordination Problems in Ad Hoc Radio Networks
- Theoretical Computer Science
- Improved lower bound for deterministic broadcasting in radio networks
- The Wakeup Problem
- Modeling radio networks
- The abstract MAC layer
- Energy efficient alert in single-hop networks of extremely weak devices
- Faster deterministic wakeup in multiple access channels
- Scalable wake-up of multi-channel single-hop radio networks
- Fast radio broadcasting with advice
- Acknowledged broadcasting in ad hoc radio networks
This page was built for publication: The wakeup problem in synchronous broadcast systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719162)
