On the public citation graph

A randomized algorithm for gossiping in radio networks

https://doi.org/10.1002/net.10109
0 signed · 48 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230180406openalex-snapshot
A survey of gossiping and broadcasting in communication networks
inferredcites →https://doi.org/10.1007/3-540-45022-x_60openalex-snapshot
Deterministic Radio Broadcasting
inferredcites →https://doi.org/10.1007/3-540-45465-9_33openalex-snapshot
Gossiping with Bounded Size Messages in ad hoc Radio Networks
inferredcites →https://doi.org/10.1007/3-540-48481-7_5openalex-snapshot
The Impact of Knowledge on Broadcasting Time in Radio Networks
inferredcites →https://doi.org/10.1007/3-540-68530-8_24openalex-snapshot
Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-1-4613-1353-3openalex-snapshot
Wireless Information Networks
inferredcites →https://doi.org/10.1007/s004460050030openalex-snapshot
Lower bounds for the broadcast problem in mobile radio networks
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(91)90015-wopenalex-snapshot
A lower bound for radio broadcast
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/0166-218x(93)e0176-yopenalex-snapshot
Asymptotically optimal gossiping in radio networks
inferredcites →https://doi.org/10.1016/0196-6774(92)90015-5openalex-snapshot
Single round simulation on radio networks
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1023/a:1019128411323openalex-snapshot
A new model for scheduling packet radio networks
inferredcites →https://doi.org/10.1109/18.720543openalex-snapshot
Information theory and communication networks: an unconsummated union
inferredcites →https://doi.org/10.1109/infcom.1996.493055openalex-snapshot
A new model for scheduling packet radio networks
inferredcites →https://doi.org/10.1109/tcom.1985.1096216openalex-snapshot
A Multiaccess Protocol for 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.1057010openalex-snapshot
The collision channel without feedback
inferredcites →https://doi.org/10.1109/tit.1985.1057020openalex-snapshot
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
inferredcites →https://doi.org/10.1109/tit.1985.1057022openalex-snapshot
A perspective on multiaccess channels
inferredcites →https://doi.org/10.1137/0222055openalex-snapshot
Multiple Communication in Multihop Radio Networks
inferredcites →https://doi.org/10.1137/s0097539794279109openalex-snapshot
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
inferredcites →https://doi.org/10.1142/s0129626496000121openalex-snapshot
GOSSIPING ON A RING WITH RADIOS
inferredcites →https://doi.org/10.5555/314613.314709openalex-snapshot
Computation in noisy 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/978-0-387-30162-4_324openalex-snapshot
Randomized Gossiping in 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-1-4939-2864-4_324openalex-snapshot
Randomized Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_11openalex-snapshot
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
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-77120-3_22openalex-snapshot
Sensor Network Gossiping or How to Break the Broadcast Lower Bound
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_2openalex-snapshot
On Efficient Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_324-2openalex-snapshot
Randomized Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_21openalex-snapshot
Faster Information Gathering in Ad-Hoc Radio Tree Networks
inferred← citeshttps://doi.org/10.1007/s00453-006-1212-3openalex-snapshot
Deterministic Communication in Radio Networks with Large Labels
inferred← citeshttps://doi.org/10.1007/s00453-017-0336-yopenalex-snapshot
Faster Information Gathering in Ad-Hoc Radio Tree Networks
inferred← citeshttps://doi.org/10.1016/j.ic.2017.11.003openalex-snapshot
Information gathering in ad-hoc radio networks with tree topology
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104769openalex-snapshot
Information gathering in ad-hoc radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.030openalex-snapshot
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
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.1109/glocom.2006.937openalex-snapshot
WSN03-1: A Dynamic Distributed Diagnosis Protocol for Wireless and Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/jsen.2015.2462740openalex-snapshot
DTMAC: A Delay Tolerant MAC Protocol for Underwater Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/mass.2013.82openalex-snapshot
Neighbor Discovery in Multichannel Wireless Clique Networks: An Epidemic Approach
inferred← citeshttps://doi.org/10.1109/tit.2022.3219773openalex-snapshot
Low Latency Allcast Over Broadcast Erasure Channels
inferred← citeshttps://doi.org/10.1145/1164717.1164747openalex-snapshot
Performance analysis of a distributed comparison-based self-diagnosis protocol for wireless ad-hoc networks
inferred← citeshttps://doi.org/10.1145/1186778.1186782openalex-snapshot
A survey of autonomic communications
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2023.45openalex-snapshot
Beeping Shortest Paths via Hypergraph Bipartite Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1610.02931openalex-snapshot
Multi-Message Broadcast in Dynamic 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.