On the public citation graph

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

https://doi.org/10.1002/dac.726
0 signed · 43 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/(sici)1098-2418(199909)15:2<145::aid-rsa2>3.0.co;2-gopenalex-snapshot
Onk-connectivity for a geometric random graph
inferredcites →https://doi.org/10.1002/net.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1016/0012-365x(90)90358-oopenalex-snapshot
Unit disk graphs
inferredcites →https://doi.org/10.1023/a:1019186624837openalex-snapshot
A new approach to the design and analysis of peer‐to‐peer mobile 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/infcom.2002.1019411openalex-snapshot
Distributed construction of connected dominating set in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/tpds.2003.1195412openalex-snapshot
Geometric spanners for wireless ad hoc networks
inferredcites →https://doi.org/10.1111/j.1365-3121.1992.tb00605.xopenalex-snapshot
STATISTICS FOR SPATIAL DATA
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/513800.513811openalex-snapshot
On the minimum node degree and connectivity of a wireless multihop network
inferredcites →https://doi.org/10.1145/513800.513820openalex-snapshot
Message-optimal connected dominating sets in mobile ad hoc networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.1067openalex-snapshot
An adaptive joining mechanism for improving the connection ratio of ZigBee wireless sensor networks
inferred← citeshttps://doi.org/10.1002/dac.4745openalex-snapshot
Connectivity analysis of directed highway vehicular ad hoc networks using graph theory
inferred← citeshttps://doi.org/10.1002/dac.v23:2openalex-snapshot
inferred← citeshttps://doi.org/10.1002/wcm.547openalex-snapshot
A novel distributed MCDS approximation algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_28openalex-snapshot
Distributed Connected Dominating Sets in Unit Square and Disk Graphs
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.1016/j.compeleceng.2008.07.002openalex-snapshot
Adjusted probabilistic route discovery in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.csi.2020.103490openalex-snapshot
A fault-tolerant and distributed capacitated connected dominating set algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.dam.2020.01.033openalex-snapshot
Connected domination in maximal outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.jnca.2011.07.007openalex-snapshot
A family of simple distributed minimum connected dominating set-based topology construction algorithms
inferred← citeshttps://doi.org/10.1016/j.jocs.2012.01.003openalex-snapshot
Self-stabilizing algorithm for efficient topology control in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.01.023openalex-snapshot
Distributed construction of connected dominating set in unit disk graphs
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.1109/ipdps.2007.370464openalex-snapshot
A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set
inferred← citeshttps://doi.org/10.1109/iscc.2011.5984029openalex-snapshot
Self-stabilizing algorithm for energy saving in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/iscid.2013.25openalex-snapshot
Solving Minimum Connected Dominating Set on Proper Interval Graph
inferred← citeshttps://doi.org/10.1109/latincom.2010.5641018openalex-snapshot
An optimal solution to the MCDS problem for topology construction in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/mascots.2007.1openalex-snapshot
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tla.2011.5993740openalex-snapshot
A Mathematical Solution to the MCDS Problem for Topology Construction in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/wcsn.2008.4772680openalex-snapshot
A balanced 1-hop clustering scheme for Mobile Ad Hoc Network
inferred← citeshttps://doi.org/10.1109/wicom.2007.662openalex-snapshot
CDS-HG: A New Distributed MCDS Approximation Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1142/s0129054110007362openalex-snapshot
A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET
inferred← citeshttps://doi.org/10.1142/s0129626423400182openalex-snapshot
A Survey on Variant Domination Problems in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1371/journal.pone.0023016openalex-snapshot
Dominating Biological Networks
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.230openalex-snapshot
Adaptive scalable protocols for heterogeneous wireless networks
inferred← citeshttps://doi.org/10.3390/math7121173openalex-snapshot
Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems
inferred← citeshttps://doi.org/10.4018/978-1-4666-0321-9.ch002openalex-snapshot
Multicast Routing Protocols in MANET
inferred← citeshttps://doi.org/10.5120/ijca2016910349openalex-snapshot
A Survey of Connected Dominating Set Algorithms for Virtual Backbone Construction in Ad Hoc Networks
inferred← citeshttps://doi.org/10.5815/ijcnis.2017.12.07openalex-snapshot
A Fault-tolerant Improved OLSR Protocol using k-Connected m-Dominating Set
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.