On the public citation graph
Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor 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/wcm.356openalex-snapshot
On greedy construction of connected dominating sets in wireless networks
inferredcites →https://doi.org/10.1007/978-3-319-10903-9_6openalex-snapshot
A Perturbation-Proof Self-stabilizing Algorithm for Constructing Virtual Backbones in Wireless Ad-Hoc Networks
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s11276-014-0819-6openalex-snapshot
An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks
inferredcites →https://doi.org/10.1016/j.adhoc.2016.02.003openalex-snapshot
Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set
inferredcites →https://doi.org/10.1016/j.comgeo.2015.02.004openalex-snapshot
On full Steiner trees in unit disk graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2011.07.002openalex-snapshot
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
inferredcites →https://doi.org/10.1016/j.tcs.2004.08.013openalex-snapshot
A greedy approximation for minimum connected dominating sets
inferredcites →https://doi.org/10.1109/71.963415openalex-snapshot
Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks
inferredcites →https://doi.org/10.1109/atnac.2011.6096632openalex-snapshot
A survey on backbone formation algorithms for Wireless Sensor Networks: (A New Classification)
inferredcites →https://doi.org/10.1109/icact.2014.6779007openalex-snapshot
A virtual backbone based approach for cooperative caching in mobile 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/icwmc.2007.14openalex-snapshot
A Weight-Based Clustering Algorithm for Mobile Ad Hoc Network
inferredcites →https://doi.org/10.1109/infocom.2016.7524456openalex-snapshot
Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks
inferredcites →https://doi.org/10.1109/jsac.2002.807342openalex-snapshot
Performance analysis of ad hoc wireless LANs for real-time traffic
inferredcites →https://doi.org/10.1109/lcn.2014.6925829openalex-snapshot
A stable minimum velocity CDS-based virtual backbone for VANET in city environment
inferredcites →https://doi.org/10.1109/tnet.2015.2475335openalex-snapshot
On Approximating Minimum 3-Connected $m$-Dominating Set Problem in Unit Disk Graph
inferredcites →https://doi.org/10.1109/tnn.2009.2015088openalex-snapshot
A Neural Network Model to Minimize the Connected Dominating Set for Self-Configuration of Wireless Sensor Networks
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.1109/tpds.2009.78openalex-snapshot
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks
inferredcites →https://doi.org/10.1177/1550147717733390openalex-snapshot
An efficient reconfigurable ad-hoc algorithm for multi-sink wireless sensor networks
inferredcites →https://doi.org/10.1186/1687-1499-2012-83openalex-snapshot
An energy efficient MCDS construction algorithm for wireless sensor networks
inferredcites →https://doi.org/10.14257/ijmue.2015.10.7.34openalex-snapshot
Node Deployment Algorithm Based on Improved Steiner Tree
inferredcites →https://doi.org/10.1504/ijsnet.2013.053719openalex-snapshot
Connected dominating set algorithms for wireless sensor networks
inferredcites →https://doi.org/10.2298/csis110927038jopenalex-snapshot
Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11227-023-05180-9openalex-snapshot
Construction of node- and link-fault-tolerant virtual backbones in wireless 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.eswa.2021.114913openalex-snapshot
ExEm: Expert embedding using dominating set theory with deep learning approaches
inferred← citeshttps://doi.org/10.1016/j.procs.2026.06.367openalex-snapshot
Modelling the Minimum Dominating Set Problem using CPN Tools
inferred← citeshttps://doi.org/10.1109/access.2024.3374409openalex-snapshot
ACapDS: An Energy-Efficient and Fault-Tolerant Distributed Capacitated Dominating Set Algorithm for Industrial IoT
inferred← citeshttps://doi.org/10.1109/aiccsa47632.2019.9035307openalex-snapshot
CMHWN: Coverage Maximization of Heterogeneous Wireless Network
inferred← citeshttps://doi.org/10.1134/s1064226921130040openalex-snapshot
Note on Dominating Set Problems
inferred← citeshttps://doi.org/10.1145/3789456.3789472openalex-snapshot
LHR-SN: A SuperNet-Aware Layered Hybrid Routing Protocol with Bordercasting
inferred← citeshttps://doi.org/10.17762/ijcnis.v15i1.5810openalex-snapshot
Using Minimum Connected Dominating Set for Mobile sink path planning in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3233/atde240064openalex-snapshot
Topology Control Method for UAV Clusters Based on the Virtual Backbone Network
inferred← citeshttps://doi.org/10.3390/fi15050182openalex-snapshot
Efficient Mobile Sink Routing in Wireless Sensor Networks Using Bipartite Graphs
inferred← citeshttps://doi.org/10.3390/math14183382openalex-snapshot
The h-Hop Dominating Subnetwork Problem: Variants, Structural Properties, and Exact Solution Approaches
inferred← citeshttps://doi.org/10.3991/ijim.v17i18.42121openalex-snapshot
Performance Analysis of Sink Mobility Models for Wireless Sensor Networks: A Comparative Study
inferred← citeshttps://doi.org/10.4018/ijwnbt.2020070101openalex-snapshot
A Binary Search Algorithm to Determine the Minimum Transmission Range for Minimum Connected Dominating Set of a Threshold Size in Ad Hoc Networks
inferred← citeshttps://doi.org/10.5755/j01.itc.49.2.24111openalex-snapshot
On Improving Reliability in Multicast Routing Protocol for Wireless Sensor Network
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.