On the public citation graph
Multiple Communication in Multihop Radio Networks
0 signed · 126 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/bf02259748openalex-snapshot
Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
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/0890-5401(88)90016-8openalex-snapshot
The multi-tree approach to reliability in distributed networks
inferredcites →https://doi.org/10.1057/jors.1984.224openalex-snapshot
Comparison Methods for Queues and Other Stochastic Models
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/tcom.1976.1093299openalex-snapshot
Behavior of Tandem Buffers with Geometric Input and Markovian Output
inferredcites →https://doi.org/10.1109/tcom.1979.1094298openalex-snapshot
Generalized TDMA: The Multi-Accessing Tree Protocol
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
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.ch24openalex-snapshot
Broadcasting in Radio Networks
inferred← citeshttps://doi.org/10.1002/net.10109openalex-snapshot
A randomized algorithm for gossiping in radio networks
inferred← citeshttps://doi.org/10.1002/net.21451openalex-snapshot
Optimal gossiping in geometric radio networks in the presence of dynamical faults
inferred← citeshttps://doi.org/10.1006/jagm.2000.1147openalex-snapshot
Fault-Tolerant Broadcasting in Radio Networks
inferred← citeshttps://doi.org/10.1007/11523468_92openalex-snapshot
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks
inferred← citeshttps://doi.org/10.1007/11780823_20openalex-snapshot
Average-Time Complexity of Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/11785293_31openalex-snapshot
An Approximation Algorithm for the Wireless Gathering Problem
inferred← citeshttps://doi.org/10.1007/11945529_19openalex-snapshot
On Many-to-Many Communication in Packet Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_54openalex-snapshot
A Randomized Algorithm for Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_11openalex-snapshot
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_60openalex-snapshot
Deterministic Radio Broadcasting
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_33openalex-snapshot
Gossiping with Bounded Size Messages in ad hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_46openalex-snapshot
Deterministic Communication in Radio Networks with Large Labels
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_17openalex-snapshot
Gossiping with Unit Messages in Known Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_5openalex-snapshot
Optimal Multi-broadcast with Beeps Using Group Testing
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-540-24749-4_37openalex-snapshot
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_16openalex-snapshot
Time Efficient Gossiping in Known Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_6openalex-snapshot
Asynchronous Broadcast in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_9openalex-snapshot
The Distributed Wireless Gathering Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_39openalex-snapshot
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_18openalex-snapshot
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks
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-540-77120-3_22openalex-snapshot
Sensor Network Gossiping or How to Break the Broadcast Lower Bound
inferred← citeshttps://doi.org/10.1007/978-3-540-92862-1_3openalex-snapshot
Minimizing Average Flow Time in Sensor Data Gathering
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-02250-0_14openalex-snapshot
Data Gathering in Wireless Networks
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-14849-1_11openalex-snapshot
Coordination Problems in Ad Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_49openalex-snapshot
Efficient Distributed Communication in Ad-Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_10openalex-snapshot
Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_7openalex-snapshot
Bounded-Contention Coding for Wireless Networks in the High SNR Regime
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_34openalex-snapshot
Fast Structuring of Radio Networks Large for Multi-message Communications
inferred← citeshttps://doi.org/10.1007/bfb0100610openalex-snapshot
Performance analysis of broadcast in synchronized multihop wireless networks
inferred← citeshttps://doi.org/10.1007/s00224-023-10131-1openalex-snapshot
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
inferred← citeshttps://doi.org/10.1007/s002240010006openalex-snapshot
Efficient Communication Strategies for Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1007/s00446-014-0230-7openalex-snapshot
Randomized broadcast in radio networks with collision detection
inferred← citeshttps://doi.org/10.1007/s00446-015-0244-9openalex-snapshot
Bounded-Contention Coding for the additive network model
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-007-9123-5openalex-snapshot
Many-to-Many Communication in Radio Networks
inferred← citeshttps://doi.org/10.1007/s00453-023-01095-2openalex-snapshot
Transmitting Once to Elect a Leader on Wireless Networks
inferred← citeshttps://doi.org/10.1007/s10878-014-9804-3openalex-snapshot
Bounded information dissemination in multi-channel wireless networks
inferred← citeshttps://doi.org/10.1007/s446-002-8028-1openalex-snapshot
Deterministic broadcasting in ad hoc radio networks
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90180-5openalex-snapshot
Methods and problems of communication in usual networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2011.12.001openalex-snapshot
Decomposing broadcast algorithms using abstract MAC layers
inferred← citeshttps://doi.org/10.1016/j.ic.2006.10.001openalex-snapshot
Quasi-optimal energy-efficient leader election algorithms in radio 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.orl.2008.06.001openalex-snapshot
An approximation algorithm for the wireless gathering problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.002openalex-snapshot
Energy efficient randomised communication in unknown AdHoc networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.018openalex-snapshot
The distributed wireless gathering problem
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.2014.06.043openalex-snapshot
Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00178-2openalex-snapshot
Faster broadcasting in unknown radio networks
inferred← citeshttps://doi.org/10.1016/s0140-3664(99)00205-4openalex-snapshot
Performance analysis of broadcast in mobile ad hoc networks with synchronized and non-synchronized reception
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00004-4openalex-snapshot
Fast broadcasting and gossiping in radio networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00256-0openalex-snapshot
The impact of information on broadcasting time in linear radio networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00538-8openalex-snapshot
The minimum broadcast range assignment problem on linear multi-hop wireless networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00851-4openalex-snapshot
Distributed broadcast in radio networks of unknown topology
inferred← citeshttps://doi.org/10.1023/a:1013763825347openalex-snapshot
The Broadcast Storm Problem in a Mobile Ad Hoc Network
inferred← citeshttps://doi.org/10.1080/17445760903548275openalex-snapshot
Design and performance evaluation of communication algorithms in multihop wireless networks with multiple channels
inferred← citeshttps://doi.org/10.1080/23799927.2025.2454546openalex-snapshot
On messy broadcasting in directed hyper-cylinder graphs
inferred← citeshttps://doi.org/10.1109/26.79285openalex-snapshot
The wave expansion approach to broadcasting in multihop radio networks
inferred← citeshttps://doi.org/10.1109/aina.2010.91openalex-snapshot
RBP: Reliable Broadcasting Protocol in Large Scale Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icccs57501.2023.10150591openalex-snapshot
Data Collection Scheduling in Directional Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icdcsw.2005.120openalex-snapshot
Reconciling the Theory and Practice of (Un)Reliable Wireless Broadcast
inferred← citeshttps://doi.org/10.1109/icdcsw.2009.53openalex-snapshot
Transmission Time Minimization Algorithms in Multihop Wireless Networks with Multiple Channels
inferred← citeshttps://doi.org/10.1109/icpwc.2000.905834openalex-snapshot
Transmission scheduling for gossiping in multihop packet radio networks
inferred← citeshttps://doi.org/10.1109/iemcon.2018.8615099openalex-snapshot
Scheduling Problems in Wireless Sensor Networks and Internet of Things: A Comparative Overview
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062150openalex-snapshot
Interference-Resilient Information Exchange
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567048openalex-snapshot
Efficient distributed multiple-message broadcasting in unstructured wireless networks
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213407openalex-snapshot
On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks
inferred← citeshttps://doi.org/10.1109/ipdps.2005.210openalex-snapshot
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1109/lcomm.2016.2539940openalex-snapshot
Near-Optimal BFS-Tree Construction in Radio Networks
inferred← citeshttps://doi.org/10.1109/nrsc.1999.760908openalex-snapshot
The impacts of synchronized and non-synchronized reception on broadcast in multihop radio networks
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892325openalex-snapshot
Fast broadcasting and gossiping in radio networks
inferred← citeshttps://doi.org/10.1109/tit.2022.3219773openalex-snapshot
Low Latency Allcast Over Broadcast Erasure Channels
inferred← citeshttps://doi.org/10.1109/tnet.2021.3069324openalex-snapshot
Distributed Byzantine-Resilient Multiple-Message Dissemination in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2022.3198331openalex-snapshot
Distributed Stable Multisource Global Broadcast for SINR-Based Wireless Multihop Networks
inferred← citeshttps://doi.org/10.1109/tnet.2024.3470649openalex-snapshot
Distributed Stable Multi-Source Dynamic Broadcasting for Wireless Multi-Hop Networks Under SINR-Based Adversarial Channel Jamming
inferred← citeshttps://doi.org/10.1109/tpds.2009.123openalex-snapshot
Minimum Latency Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1109/tpds.2010.77openalex-snapshot
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1109/tpds.2011.310openalex-snapshot
Multisource Broadcast in Wireless Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973402.132openalex-snapshot
Broadcast Throughput in Radio Networks: Routing vs. Network Coding
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.1145/1011767.1011806openalex-snapshot
A better wake-up in radio 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/1248377.1248419openalex-snapshot
Energy efficient randomised communication in unknown AdHoc networks
inferred← citeshttps://doi.org/10.1145/1374618.1374662openalex-snapshot
Minimum-latency gossiping in multi-hop wireless networks
inferred← citeshttps://doi.org/10.1145/1400751.1400767openalex-snapshot
Secure communication over radio channels
inferred← citeshttps://doi.org/10.1145/1860684.1860690openalex-snapshot
Decomposing broadcast algorithms using abstract MAC layers
inferred← citeshttps://doi.org/10.1145/1978782.1978788openalex-snapshot
Minimizing flow time in the wireless gathering problem
inferred← citeshttps://doi.org/10.1145/1993806.1993884openalex-snapshot
Time-efficient randomized multiple-message broadcast in radio networks
inferred← citeshttps://doi.org/10.1145/2484239.2484248openalex-snapshot
Randomized broadcast in radio networks with collision detection
inferred← citeshttps://doi.org/10.1145/2634274.2634279openalex-snapshot
Dynamic multiple-message broadcast
inferred← citeshttps://doi.org/10.1145/2767386.2767432openalex-snapshot
A Local Broadcast Layer for the SINR Network Model
inferred← citeshttps://doi.org/10.1145/277651.277692openalex-snapshot
Efficient communication strategies for ad-hoc wireless networks (extended abstract)
inferred← citeshttps://doi.org/10.1145/3087801.3087828openalex-snapshot
Analyzing Contention and Backoff in Asynchronous Shared Memory
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/346855.346865openalex-snapshot
Multicast tree construction and flooding in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1145/381448.381454openalex-snapshot
Oblivious gossiping in ad-hoc radio networks
inferred← citeshttps://doi.org/10.1145/383962.384040openalex-snapshot
Distributed multi-broadcast in unknown radio networks
inferred← citeshttps://doi.org/10.1155/2014/501534openalex-snapshot
Energy-Efficient Reliable Broadcast Protocol for WSNs Based on IEEE 802.15.5
inferred← citeshttps://doi.org/10.48550/arxiv.1407.1521openalex-snapshot
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04514openalex-snapshot
A Local Broadcast Layer for the SINR Network Model
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01587openalex-snapshot
An Optimal Randomized Broadcasting Algorithm in Radio Networks with Collision Detection
inferred← citeshttps://doi.org/10.5555/982792.982941openalex-snapshot
The wake-up problem in multi-hop radio networks
inferred← citeshttps://doi.org/10.6100/ir633780openalex-snapshot
Online gathering algorithms for wireless networks
inferred← citeshttps://doi.org/10.70675/f333a0d5z3c0bz42f3z955az7e3873251f5fopenalex-snapshot
Overcoming interference in the beeping communication model
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.