The Wakeup Problem in Synchronous Broadcast Systems
From MaRDI portal
Publication:2719162
DOI10.1137/S0895480100376022zbMath0968.68197OpenAlexW2093347633MaRDI QIDQ2719162
Andrzej Pelc, David Peleg, Leszek Gąsieniec
Publication date: 21 June 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480100376022
Related Items (26)
Design patterns in beeping algorithms: examples, emulation, and analysis ⋮ 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 ⋮ Unbounded contention resolution in multiple-access channels ⋮ Faster deterministic wakeup in multiple access channels ⋮ Fast Radio Broadcasting with Advice ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Activating anonymous ad hoc radio networks ⋮ Deterministic broadcasting in ad hoc radio networks ⋮ Modeling radio networks ⋮ The abstract MAC layer ⋮ Coordination Problems in Ad Hoc Radio Networks ⋮ Randomized mutual exclusion on a multiple access channel ⋮ Fast radio broadcasting with advice ⋮ Contention resolution on a fading channel ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Energy efficient alert in single-hop networks of extremely weak devices ⋮ Unnamed Item ⋮ Global synchronization and consensus using beeps in a fault-prone multiple access channel ⋮ Many-to-many communication in radio networks ⋮ Local queuing under contention ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Efficient and competitive broadcast in multi-channel radio networks
This page was built for publication: The Wakeup Problem in Synchronous Broadcast Systems
