On the public citation graph
On the Wake-Up Problem in Radio Networks
0 signed · 70 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-36136-7_47openalex-snapshot
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
inferredcites →https://doi.org/10.1007/3-540-44666-4_24openalex-snapshot
On Computing Ad-hoc Selective Families
inferredcites →https://doi.org/10.1007/s446-002-8028-1openalex-snapshot
Deterministic broadcasting in ad hoc radio networks
inferredcites →https://doi.org/10.1016/0022-0000(92)90042-hopenalex-snapshot
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
inferredcites →https://doi.org/10.1016/s0304-3975(02)00851-4openalex-snapshot
Distributed broadcast in radio networks of unknown topology
inferredcites →https://doi.org/10.1109/26.79285openalex-snapshot
The wave expansion approach to broadcasting in multihop radio networks
inferredcites →https://doi.org/10.1109/sfcs.2002.1181883openalex-snapshot
Deterministic broadcasting time in radio networks of unknown topology
inferredcites →https://doi.org/10.1109/sfcs.2003.1238222openalex-snapshot
Broadcasting algorithms in radio networks with unknown topology
inferredcites →https://doi.org/10.1109/tcom.1985.1096245openalex-snapshot
On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
inferredcites →https://doi.org/10.1109/tit.1964.1053689openalex-snapshot
Nonrandom binary superimposed codes
inferredcites →https://doi.org/10.1137/s0895480100376022openalex-snapshot
The Wakeup Problem in Synchronous Broadcast Systems
inferredcites →https://doi.org/10.1145/1011767.1011806openalex-snapshot
A better wake-up in radio networks
inferredcites →https://doi.org/10.1145/380752.380790openalex-snapshot
Loss-less condensers, unbalanced expanders, and extractors
inferredcites →https://doi.org/10.1145/41840.41849openalex-snapshot
On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization
inferredcites →https://doi.org/10.1145/872035.872045openalex-snapshot
Broadcasting in undirected ad hoc radio networks
inferredcites →https://doi.org/10.5555/982792.982941openalex-snapshot
The wake-up problem in multi-hop radio networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11560586_16openalex-snapshot
Faster Deterministic Wakeup in Multiple Access Channels
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_536openalex-snapshot
Wake-Up Problem in Multi-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_13openalex-snapshot
Scalable Wake-up of Multi-channel Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_2openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
inferred← citeshttps://doi.org/10.1007/978-3-540-77115-9_1openalex-snapshot
Time-Efficient Broadcasting in Radio Networks: A Review
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_12openalex-snapshot
Time-Efficient Broadcast in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_51openalex-snapshot
Consensus and Mutual Exclusion in a Multiple Access Channel
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_11openalex-snapshot
Coordination Problems in Ad Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-16988-5_6openalex-snapshot
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_14openalex-snapshot
Communication Complexity of Consensus in Anonymous Message Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_536-1openalex-snapshot
The Wake-Up Problem in Multi-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/s00446-016-0265-zopenalex-snapshot
Randomized mutual exclusion on a multiple access channel
inferred← citeshttps://doi.org/10.1007/s00446-021-00403-9openalex-snapshot
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
inferred← citeshttps://doi.org/10.1007/s00446-025-00490-yopenalex-snapshot
Contention resolution with message deadlines
inferred← citeshttps://doi.org/10.1007/s00453-007-9123-5openalex-snapshot
Many-to-Many Communication in Radio Networks
inferred← citeshttps://doi.org/10.1016/j.dam.2006.08.009openalex-snapshot
Faster deterministic wakeup in multiple access channels
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.003openalex-snapshot
Improved lower bound for deterministic broadcasting in radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.044openalex-snapshot
Energy efficient alert in single-hop networks of extremely weak devices
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.046openalex-snapshot
Scalable wake-up of multi-channel single-hop radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.020openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel
inferred← citeshttps://doi.org/10.1109/dcoss.2011.5982163openalex-snapshot
Distributed local broadcasting algorithms in the physical interference model
inferred← citeshttps://doi.org/10.1109/icdcs51616.2021.00100openalex-snapshot
Deterministic Contention Resolution without Collision Detection: Throughput vs Energy
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218605openalex-snapshot
On setting-up asynchronous ad hoc wireless networks
inferred← citeshttps://doi.org/10.1109/ipdps.2013.68openalex-snapshot
Contention Resolution in a Non-synchronized Multiple Access Channel
inferred← citeshttps://doi.org/10.1109/tpds.2010.162openalex-snapshot
Consensus and Mutual Exclusion in a Multiple Access Channel
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch47openalex-snapshot
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
inferred← citeshttps://doi.org/10.1137/17m1111322openalex-snapshot
Deterministic Communication in Radio Networks
inferred← citeshttps://doi.org/10.1137/17m1158604openalex-snapshot
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses
inferred← citeshttps://doi.org/10.1145/1146381.1146398openalex-snapshot
Adversarial queuing on the multiple-access channel
inferred← citeshttps://doi.org/10.1145/1186778.1186782openalex-snapshot
A survey of autonomic communications
inferred← citeshttps://doi.org/10.1145/1998476.1998487openalex-snapshot
Time-optimal information exchange on multiple channels
inferred← citeshttps://doi.org/10.1145/2071379.2071384openalex-snapshot
Adversarial Queuing on the Multiple Access Channel
inferred← citeshttps://doi.org/10.1145/2897518.2897655openalex-snapshot
Contention resolution with log-logstar channel accesses
inferred← citeshttps://doi.org/10.1145/3087556.3087584openalex-snapshot
Is Our Model for Contention Resolution Wrong?
inferred← citeshttps://doi.org/10.1145/3350755.3400239openalex-snapshot
Contention Resolution with Message Deadlines
inferred← citeshttps://doi.org/10.1145/3357713.3384305openalex-snapshot
Contention resolution without collision detection
inferred← citeshttps://doi.org/10.1145/3382734.3405699openalex-snapshot
Can Uncoordinated Beeps tell Stories?
inferred← citeshttps://doi.org/10.1145/3465084.3467920openalex-snapshot
Tight Trade-off in Contention Resolution without Collision Detection
inferred← citeshttps://doi.org/10.1145/3490148.3538573openalex-snapshot
Contention Resolution for Coded Radio Networks
inferred← citeshttps://doi.org/10.1145/3490148.3538592openalex-snapshot
Robust and Optimal Contention Resolution without Collision Detection
inferred← citeshttps://doi.org/10.1145/3733594openalex-snapshot
A Survey on Adversarial Contention Resolution
inferred← citeshttps://doi.org/10.1145/3798129.3800797openalex-snapshot
Contention Resolution, with and without a Global Clock
inferred← citeshttps://doi.org/10.3233/fi-2015-1181openalex-snapshot
Communication Complexity of Consensus in Anonymous Message Passing Systems
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2446openalex-snapshot
Dynamic Sharing of a Multiple Access Channel
inferred← citeshttps://doi.org/10.46298/dmtcs.528openalex-snapshot
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network
inferred← citeshttps://doi.org/10.48550/arxiv.1402.5207openalex-snapshot
How to Scale Exponential Backoff
inferred← citeshttps://doi.org/10.48550/arxiv.1508.06583openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
inferred← citeshttps://doi.org/10.48550/arxiv.1908.10388openalex-snapshot
Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds
inferred← citeshttps://doi.org/10.70675/f333a0d5z3c0bz42f3z955az7e3873251f5fopenalex-snapshot
Overcoming interference in the beeping communication model
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.