On the public citation graph
Low-Latency Broadcast Scheduling in Ad Hoc Networks
0 signed · 41 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.1002/net.10097openalex-snapshot
A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks
inferredcites →https://doi.org/10.1002/net.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
inferredcites →https://doi.org/10.1007/3-540-61680-2_55openalex-snapshot
Approximation algorithms for connected dominating sets
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_10openalex-snapshot
Polylogarithmic Inapproximability of the Radio Broadcast Problem
inferredcites →https://doi.org/10.1007/978-3-540-27821-4_16openalex-snapshot
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks
inferredcites →https://doi.org/10.1007/s004460050030openalex-snapshot
Lower bounds for the broadcast problem in mobile 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/j.jalgor.2003.11.004openalex-snapshot
Logarithmic inapproximability of the radio broadcast problem
inferredcites →https://doi.org/10.1016/s0196-6774(02)00292-4openalex-snapshot
Centralized broadcast in multihop radio networks
inferredcites →https://doi.org/10.1023/a:1013763825347openalex-snapshot
The Broadcast Storm Problem in a Mobile Ad Hoc Network
inferredcites →https://doi.org/10.1023/a:1019045801829openalex-snapshot
Spine routing in ad hoc networks
inferredcites →https://doi.org/10.1023/a:1019128411323openalex-snapshot
A new model for scheduling packet radio networks
inferredcites →https://doi.org/10.1023/b:mone.0000013625.87793.13openalex-snapshot
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
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/90.222924openalex-snapshot
Scheduling algorithms for multihop radio networks
inferredcites →https://doi.org/10.1109/90.282605openalex-snapshot
Making transmission schedules immune to topology changes in multi-hop packet radio networks
inferredcites →https://doi.org/10.1109/90.700893openalex-snapshot
An optimal topology-transparent scheduling method in multihop packet radio networks
inferredcites →https://doi.org/10.1109/90.811446openalex-snapshot
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
inferredcites →https://doi.org/10.1109/icc.1997.605303openalex-snapshot
Routing in ad-hoc networks using minimum connected dominating sets
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.1137/s0097539794279109openalex-snapshot
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
inferredcites →https://doi.org/10.1137/s0895480104445319openalex-snapshot
Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem
inferredcites →https://doi.org/10.1145/313451.313525openalex-snapshot
The broadcast storm problem in a mobile ad hoc network
inferredcites →https://doi.org/10.1145/513800.513820openalex-snapshot
Message-optimal connected dominating sets in mobile ad hoc networks
inferredcites →https://doi.org/10.1145/778415.778442openalex-snapshot
Minimizing broadcast latency and redundancy in ad hoc networks
inferredcites →https://doi.org/10.1201/9781420040401.ch29openalex-snapshot
Scheduling of Broadcasts in Multihop Wireless Networks
inferredcites →https://doi.org/10.4324/9781420040401openalex-snapshot
The Handbook of Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.5555/127787.127848openalex-snapshot
Decomposing graphs into regions of small diameter
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11814856openalex-snapshot
Wireless Algorithms, Systems, and Applications
inferred← citeshttps://doi.org/10.1016/j.adhoc.2012.05.004openalex-snapshot
Interference-free energy efficient scheduling in wireless 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/iemcon.2018.8615099openalex-snapshot
Scheduling Problems in Wireless Sensor Networks and Internet of Things: A Comparative Overview
inferred← citeshttps://doi.org/10.1109/pccc.2011.6108080openalex-snapshot
Generalized broadcast scheduling in duty-cycle multi-hop wireless networks
inferred← citeshttps://doi.org/10.1109/sahcn.2013.6645009openalex-snapshot
Minimum-Latency Broadcast Scheduling for Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/tmc.2008.56openalex-snapshot
Broadcast Scheduling in Interference Environment
inferred← citeshttps://doi.org/10.1109/tvt.2014.2353856openalex-snapshot
Broadcast Scheduling with Latency and Redundancy Analysis for Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/twc.2010.07.081579openalex-snapshot
Analysis and Design of a Novel Randomized Broadcast Algorithm for Scalable Wireless Networks in the Interference Channels
inferred← citeshttps://doi.org/10.1109/wiopt.2011.5930056openalex-snapshot
Interference-free energy efficient scheduling in wireless ad hoc 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.