On the public citation graph
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
0 signed · 96 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.1109/26.79285openalex-snapshot
The wave expansion approach to broadcasting in multihop radio networks
inferredcites →https://doi.org/10.1109/tc.1987.1676861openalex-snapshot
Tree-Based Broadcasting in Multihop Radio Networks
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.1985.1057022openalex-snapshot
A perspective on multiaccess channels
inferredcites →https://doi.org/10.1137/0215032openalex-snapshot
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
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/72981.73005openalex-snapshot
Multiple communication in multi-hop radio networks
inferredcites →https://doi.org/10.1145/73007.73033openalex-snapshot
On the complexity of radio communication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471224561.ch10openalex-snapshot
Leader Election Protocols for Radio Networks
inferred← citeshttps://doi.org/10.1002/0471224561.ch9openalex-snapshot
Randomized Initialization Protocols for Radio Networks
inferred← citeshttps://doi.org/10.1002/net.10016openalex-snapshot
Deterministic radio broadcasting at low cost
inferred← citeshttps://doi.org/10.1007/11946441_26openalex-snapshot
Randomized Leader Election Protocols in Noisy Radio Networks with a Single Transceiver
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_47openalex-snapshot
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_60openalex-snapshot
Deterministic Radio Broadcasting
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_37openalex-snapshot
On Randomized Broadcasting and Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_23openalex-snapshot
Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_11openalex-snapshot
Randomized Communication in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_1openalex-snapshot
Multi-message Broadcast in Dynamic Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_10openalex-snapshot
Polylogarithmic Inapproximability of the Radio Broadcast Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_18openalex-snapshot
Radio Network Distributed Algorithms in the Unknown Neighborhood Model
inferred← citeshttps://doi.org/10.1007/978-3-642-16988-5_11openalex-snapshot
Monitoring Churn in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-28169-3_3openalex-snapshot
Immune Size Approximation Algorithms in Ad Hoc Radio Network
inferred← citeshttps://doi.org/10.1007/s00224-005-1144-3openalex-snapshot
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/s00446-022-00426-wopenalex-snapshot
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
inferred← citeshttps://doi.org/10.1016/j.ic.2018.10.001openalex-snapshot
Design patterns in beeping algorithms: Examples, emulation, and analysis
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.11.004openalex-snapshot
Logarithmic inapproximability of the radio broadcast problem
inferred← citeshttps://doi.org/10.1016/j.procs.2020.06.122openalex-snapshot
Optimal Distributed Leader Election without Decoding
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.012openalex-snapshot
Monitoring churn in wireless networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.027openalex-snapshot
Leader election in multi-hop radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.013openalex-snapshot
The cost of global broadcast in dynamic radio networks
inferred← citeshttps://doi.org/10.1023/a:1013763825347openalex-snapshot
The Broadcast Storm Problem in a Mobile Ad Hoc Network
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.5.1355openalex-snapshot
An Energy Efficient Leader Election Protocol for Radio Network with a Single Transceiver
inferred← citeshttps://doi.org/10.1109/71.819949openalex-snapshot
Broadcast-efficient protocols for mobile radio networks
inferred← citeshttps://doi.org/10.1109/71.877833openalex-snapshot
Randomized initialization protocols for ad hoc networks
inferred← citeshttps://doi.org/10.1109/71.877942openalex-snapshot
Energy-efficient initialization protocols for single-hop radio networks with no collision detection
inferred← citeshttps://doi.org/10.1109/71.932709openalex-snapshot
Energy-efficient permutation routing in radio networks
inferred← citeshttps://doi.org/10.1109/hicss.2005.516openalex-snapshot
Randomized Initialization of a Wireless Multihop Network
inferred← citeshttps://doi.org/10.1109/icnp.1993.340914openalex-snapshot
Improved randomized broadcast protocols in multi-hop radio networks
inferred← citeshttps://doi.org/10.1109/icpp.2000.876141openalex-snapshot
Energy-efficient initialization protocols for radio networks with no collision detection
inferred← citeshttps://doi.org/10.1109/icpp.2001.952068openalex-snapshot
Uniform leader election protocols for radio networks
inferred← citeshttps://doi.org/10.1109/ictel.2003.1191592openalex-snapshot
Quasi-optimal leader election algorithms in radio networks with log-logarithmic awake time-slots
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925118openalex-snapshot
Fundamental protocols for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/ispan.2002.1004275openalex-snapshot
Sorting on single-channel wireless sensor networks
inferred← citeshttps://doi.org/10.1109/mahss.2004.1392071openalex-snapshot
Efficient computation of maximal independent sets in unstructured multi-hop radio networks
inferred← citeshttps://doi.org/10.1109/rivf.2006.1696428openalex-snapshot
An energy-efficient initialization algorithm for random radio networks
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238222openalex-snapshot
Broadcasting algorithms in radio networks with unknown topology
inferred← citeshttps://doi.org/10.1109/tmc.2004.23openalex-snapshot
Extremal properties of three-dimensional sensor networks with applications
inferred← citeshttps://doi.org/10.1109/tpds.2002.1003864openalex-snapshot
Uniform leader election protocols for radio networks
inferred← citeshttps://doi.org/10.1109/tpds.2002.1158259openalex-snapshot
Energy-efficient routing in the broadcast communication model
inferred← citeshttps://doi.org/10.1109/tpds.2007.253278openalex-snapshot
Optimal Initialization and Gossiping Algorithms for Random Radio Networks
inferred← citeshttps://doi.org/10.1137/0222055openalex-snapshot
Multiple Communication in Multihop Radio Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973105.54openalex-snapshot
Near Optimal Leader Election in Multi-Hop Radio Networks
inferred← citeshttps://doi.org/10.1137/s0097539704442726openalex-snapshot
The Wake‐Up Problem in MultiHop Radio Networks
inferred← citeshttps://doi.org/10.1137/s0097539794279109openalex-snapshot
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
inferred← citeshttps://doi.org/10.1137/s0895480100376022openalex-snapshot
The Wakeup Problem in Synchronous Broadcast Systems
inferred← citeshttps://doi.org/10.1142/s0129054103001807openalex-snapshot
Sorting on Single-Channel Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1142/s0129054104002315openalex-snapshot
TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
inferred← citeshttps://doi.org/10.1142/s0219265902000628openalex-snapshot
IDENTIFYING FAULTY NODES IN WIRELESS SENSOR NETWORKS
inferred← citeshttps://doi.org/10.1145/1073814.1073850openalex-snapshot
Consensus and collision detectors in wireless Ad Hoc networks
inferred← citeshttps://doi.org/10.1145/1146381.1146398openalex-snapshot
Adversarial queuing on the multiple-access channel
inferred← citeshttps://doi.org/10.1145/1186810.1186818openalex-snapshot
An improved algorithm for radio broadcast
inferred← citeshttps://doi.org/10.1145/1582716.1582749openalex-snapshot
The wireless synchronization problem
inferred← citeshttps://doi.org/10.1145/164051.164059openalex-snapshot
An Ω( D log( N/D )) lower bound for broadcast in radio networks
inferred← citeshttps://doi.org/10.1145/1993806.1993884openalex-snapshot
Time-efficient randomized multiple-message broadcast in radio networks
inferred← citeshttps://doi.org/10.1145/2071379.2071384openalex-snapshot
Adversarial Queuing on the Multiple Access Channel
inferred← citeshttps://doi.org/10.1145/3055399.3055481openalex-snapshot
Exponential separations in the energy complexity of leader election
inferred← citeshttps://doi.org/10.1145/3087801.3087825openalex-snapshot
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
inferred← citeshttps://doi.org/10.1145/313451.313525openalex-snapshot
The broadcast storm problem in a mobile ad hoc network
inferred← citeshttps://doi.org/10.1145/3341111openalex-snapshot
Exponential Separations in the Energy Complexity of Leader Election
inferred← citeshttps://doi.org/10.1145/3382734.3405713openalex-snapshot
The Energy Complexity of BFS in Radio Networks
inferred← citeshttps://doi.org/10.1145/3409964.3461830openalex-snapshot
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
inferred← citeshttps://doi.org/10.1145/3446383openalex-snapshot
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
inferred← citeshttps://doi.org/10.1145/345848.345856openalex-snapshot
Energy-efficient randomized routing in radio networks
inferred← citeshttps://doi.org/10.1145/3465084.3467950openalex-snapshot
Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks
inferred← citeshttps://doi.org/10.1145/3614429openalex-snapshot
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
inferred← citeshttps://doi.org/10.1145/571825.571833openalex-snapshot
Efficient algorithms for leader election in radio networks
inferred← citeshttps://doi.org/10.1201/9780203489635.sec6openalex-snapshot
Fundamental Protocols to Gather Information in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.14257/astl.2017.147.67openalex-snapshot
Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS
inferred← citeshttps://doi.org/10.1484/j.rm.5.124725openalex-snapshot
Habilitation à diriger des recherches
inferred← citeshttps://doi.org/10.1504/ijwmc.2006.012475openalex-snapshot
A novel tree-based broadcast algorithm for wireless ad hoc networks
inferred← citeshttps://doi.org/10.3929/ethz-a-006744438openalex-snapshot
Efficient Computation of Maximal Independent Sets in Unstructured Multi-Hop Radio Networks
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2016.15openalex-snapshot
Design Patterns in Beeping Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02721openalex-snapshot
On Distributed Computing with Beeps
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02931openalex-snapshot
Multi-Message Broadcast in Dynamic Radio Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1711.04149openalex-snapshot
Broadcast in radio networks: time vs. energy tradeoffs
inferred← citeshttps://doi.org/10.48550/arxiv.2105.07518openalex-snapshot
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0411027openalex-snapshot
Extremal Properties of Three Dimensional Sensor Networks with Applications
inferred← citeshttps://doi.org/10.5121/ijwmn.2017.9507openalex-snapshot
Virtual Architecture and Energy Efficient Routing Protocols for 3D Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5555/1070432.1070464openalex-snapshot
Improved schedule for radio broadcast
inferred← citeshttps://doi.org/10.7282/t3pz5985openalex-snapshot
Upper and lower bounds in radio networks
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.