On the public citation graph
Self-stabilizing Wireless Connected Overlays
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.1007/11577327_15openalex-snapshot
About the Self-stabilization of a Virtual Topology for Self-organization in Ad Hoc Networks
inferredcites →https://doi.org/10.1007/11945529_30openalex-snapshot
Self-stabilizing Wireless Connected Overlays
inferredcites →https://doi.org/10.1007/978-3-540-24604-6_3openalex-snapshot
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph
inferredcites →https://doi.org/10.1007/978-3-540-27820-7_6openalex-snapshot
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
inferredcites →https://doi.org/10.1007/978-3-540-30566-8_41openalex-snapshot
An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1007/978-3-540-74742-0openalex-snapshot
Parallel and Distributed Processing and Applications
inferredcites →https://doi.org/10.1109/comswa.2007.382576openalex-snapshot
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
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/icc.2003.1204198openalex-snapshot
Distributed dominant pruning in ad hoc networks
inferredcites →https://doi.org/10.1109/icccn.1997.623288openalex-snapshot
Routing in ad hoc networks using a spine
inferredcites →https://doi.org/10.1109/icdcs.2003.1203456openalex-snapshot
Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/icpp.2001.952080openalex-snapshot
On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
inferredcites →https://doi.org/10.1109/infcom.2002.1019411openalex-snapshot
Distributed construction of connected dominating set in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/ipdps.2006.1639550openalex-snapshot
A self-stabilizing minimal dominating set algorithm with safe convergence
inferredcites →https://doi.org/10.1109/ispan.2005.38openalex-snapshot
Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks
inferredcites →https://doi.org/10.1109/jcn.2002.6596934openalex-snapshot
On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks
inferredcites →https://doi.org/10.1109/pdcat.2005.10openalex-snapshot
A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph
inferredcites →https://doi.org/10.1109/reldis.2005.27openalex-snapshot
Self Distributed Query Region Covering in Sensor Networks
inferredcites →https://doi.org/10.1109/sahcn.2005.1557111openalex-snapshot
Fault tolerant connected sensor cover with variable sensing and transmission ranges
inferredcites →https://doi.org/10.1109/tpds.2002.1036062openalex-snapshot
Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links
inferredcites →https://doi.org/10.1145/313239.313261openalex-snapshot
On calculating connected dominating set for efficient routing in ad hoc wireless networks
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/989459.989482openalex-snapshot
Locating cache proxies in manets
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-3-319-03089-0_18openalex-snapshot
An Asynchronous Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_21openalex-snapshot
Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_17openalex-snapshot
Self* Minimum Connected Covers of Query Regions in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_31openalex-snapshot
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
inferred← citeshttps://doi.org/10.1007/978-3-642-15277-1_51openalex-snapshot
Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-23400-2_12openalex-snapshot
Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network
inferred← citeshttps://doi.org/10.1007/978-3-642-33536-5_16openalex-snapshot
From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.09.004openalex-snapshot
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.009openalex-snapshot
Robust self-stabilizing weight-based clustering algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.007openalex-snapshot
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.001openalex-snapshot
An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.040openalex-snapshot
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
inferred← citeshttps://doi.org/10.1109/saso.2011.15openalex-snapshot
Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters
inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot
Time- and space-efficient self-stabilizing algorithms
inferred← citeshttps://doi.org/10.70675/6da8d938zde89z4bffzb535zed8657b6e60bopenalex-snapshot
Vers une structuration auto-stabilisante des réseaux ad hoc : cas des réseaux de capteurs sans fil
showing the first 15 of 16 · page through all 16
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.