On the public citation graph
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
0 signed · 54 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/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/j.tcs.2004.08.013openalex-snapshot
A greedy approximation for 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/jcn.2002.6596929openalex-snapshot
Distributed heuristics for connected dominating sets in wireless ad hoc networks
inferredcites →https://doi.org/10.1109/tmc.2007.1034openalex-snapshot
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
inferredcites →https://doi.org/10.1109/tpds.2004.48openalex-snapshot
An extended localized algorithm for connected dominating set formation in ad hoc wireless networks
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.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/ett.2797openalex-snapshot
Constructing load‐balanced virtual backbones in probabilistic wireless sensor networks via multi‐objective genetic algorithm
inferred← citeshttps://doi.org/10.1007/978-0-387-88619-0_1openalex-snapshot
On Enhancing Fault Tolerance of Virtual Backbone in a Wireless Sensor Network with Unidirectional Links
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_42openalex-snapshot
Connected Dominating Set in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-5242-3_10openalex-snapshot
Geometric Hitting Set and Disk Cover
inferred← citeshttps://doi.org/10.1007/978-1-4614-5242-3_11openalex-snapshot
Minimum-Latency Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4614-5242-3_4openalex-snapshot
CDS in Unit Ball Graphs and Growth Bounded Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-5242-3_5openalex-snapshot
Weighted CDS in Unit Disk Graph
inferred← citeshttps://doi.org/10.1007/978-1-4614-5242-3_7openalex-snapshot
Routing-Cost Constrained CDS
inferred← citeshttps://doi.org/10.1007/978-1-4614-5242-3_8openalex-snapshot
CDS in Disk-Containment Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-5242-3_9openalex-snapshot
CDS in Disk-Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_619openalex-snapshot
Strongly Connected Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_619-1openalex-snapshot
Strongly Connected Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_16openalex-snapshot
A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-54522-1_5openalex-snapshot
An Algorithm for Constructing Strongly Connected Dominating and Absorbing Sets in Wireless Networks with Unidirectional Links
inferred← citeshttps://doi.org/10.1007/s12652-021-03260-3openalex-snapshot
RETRACTED ARTICLE: Dominating set based virtual backbone cluster scheduling for ensuring energy efficiency in asymmetric radio WSN
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.10.005openalex-snapshot
Connected dominating sets in wireless ad hoc and sensor networks – A comprehensive survey
inferred← citeshttps://doi.org/10.1016/j.matcom.2024.09.010openalex-snapshot
Finding the minimum k -weighted dominating sets using heuristic algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.025openalex-snapshot
On approximation algorithms of k -connected m -dominating sets in disk graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.058openalex-snapshot
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.020openalex-snapshot
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/aiccsa.2009.5069451openalex-snapshot
A new distributed algorithm for virtual backbone in Wireless Sensor Networks with different transmission ranges
inferred← citeshttps://doi.org/10.1109/iccomm.2018.8430166openalex-snapshot
A Recovering Algorithm for Disconnected Virtual Backbone Nodes in Hierarchical Wireless Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2015.112openalex-snapshot
A Self-Stabilizing Algorithm for CDS Construction with Constant Approximation in Wireless Networks under SINR Model
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524455openalex-snapshot
Performance-guaranteed strongly connected dominating sets in heterogeneous wireless sensor networks
inferred← citeshttps://doi.org/10.1109/innovations.2012.6207732openalex-snapshot
A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks
inferred← citeshttps://doi.org/10.1109/istel.2008.4651324openalex-snapshot
Distributed algorithm for connected Dominating Sets in Wireless Sensor Networks with different transmission ranges
inferred← citeshttps://doi.org/10.1109/msn63567.2024.00129openalex-snapshot
An Algorithm for Constructing Virtual Backbone Network under Routing Cost Constraint for Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/pccc.2007.358882openalex-snapshot
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2019.2894749openalex-snapshot
Minimum Connected Dominating Set Under Routing Cost Constraint in Wireless Sensor Networks With Different Transmission Ranges
inferred← citeshttps://doi.org/10.1109/tnse.2020.3036755openalex-snapshot
Trusted-Region Subsequence Reduction for Designing Resilient Consensus Algorithms
inferred← citeshttps://doi.org/10.1109/wasa.2007.25openalex-snapshot
k-Strongly Connected m-Dominating and Absorbing Set in Wireless Ad Hoc Networks with Unidirectional Links
inferred← citeshttps://doi.org/10.1109/wasa.2007.72openalex-snapshot
k-Strongly Connected m-Dominating and Absorbing Set in Wireless Ad Hoc Networks with Unidirectional Links
inferred← citeshttps://doi.org/10.1134/s1064226921130040openalex-snapshot
Note on Dominating Set Problems
inferred← citeshttps://doi.org/10.1155/2020/5602325openalex-snapshot
The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network
inferred← citeshttps://doi.org/10.1155/2020/9189645openalex-snapshot
On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.13140/rg.2.2.34919.68006openalex-snapshot
On combinatorial optimization for dominating sets (literature survey, new models)
inferred← citeshttps://doi.org/10.1504/ijsnet.2015.071629openalex-snapshot
Strongly connected dominating and absorbing set in directed disk graph
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.311.87openalex-snapshot
Algorithms for Constructing Strongly Connected Dominating Set in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5897/sre10.1107openalex-snapshot
Energy-aware distributed algorithm for virtual backbone in wireless sensor networks with bidirectional links
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.