On the public citation graph
On greedy construction of connected dominating sets in wireless networks
0 signed · 195 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.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
inferredcites →https://doi.org/10.1007/3-540-44679-6_57openalex-snapshot
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points
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.1007/s10898-005-8466-1openalex-snapshot
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor 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.1016/j.tcs.2005.08.037openalex-snapshot
Minimum connected dominating sets and maximal independent sets in unit disk graphs
inferredcites →https://doi.org/10.1016/s0020-0190(98)00201-4openalex-snapshot
Steiner tree problem with minimum number of Steiner points and bounded edge-length
inferredcites →https://doi.org/10.1023/a:1008384012064openalex-snapshot
Approximations for Steiner Trees with Minimum Number of Steiner Points
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/hicss.2002.994519openalex-snapshot
New distributed algorithm for connected dominating set in wireless 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/icccn.1997.623288openalex-snapshot
Routing in ad hoc networks using a spine
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/proc.1987.13705openalex-snapshot
A design concept for reliable mobile radio networks with frequency hopping signaling
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/wcm.547openalex-snapshot
A novel distributed MCDS approximation algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1002/wcm.810openalex-snapshot
Distributed virtual backbone construction in sensor networks with asymmetric links
inferred← citeshttps://doi.org/10.1007/11610113_2openalex-snapshot
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
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-1701-9openalex-snapshot
Design and Analysis of Approximation Algorithms
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-3-030-25005-8_11openalex-snapshot
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-86637-1_41openalex-snapshot
Minimum Dominating Set and Minimum Connected Dominating Set Construction in Wireless Sensor Networks Under the Sleeping Model
inferred← citeshttps://doi.org/10.1007/978-3-032-28478-5_26openalex-snapshot
Connected-2 Dominating Set-Based Application Deployment in Fog Environment to Enhance Quality of Service
inferred← citeshttps://doi.org/10.1007/978-3-319-71150-8_17openalex-snapshot
New Insights for Power Edge Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_21openalex-snapshot
Algorithms for Minimum m-Connected k-Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-88582-5_16openalex-snapshot
Maintaining CDS in Mobile Ad Hoc 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-10631-6_71openalex-snapshot
Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14654-1_6openalex-snapshot
Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-17604-3_11openalex-snapshot
A Secure Routing Using Reliable 1-Hop Broadcast in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-23490-3_9openalex-snapshot
A Genetic Algorithm for Constructing a Reliable MCDS in Probabilistic Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_33openalex-snapshot
Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-31869-6_62openalex-snapshot
Two Connected Dominating Set Algorithms for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-981-10-7850-7_3openalex-snapshot
A Generalized Data Inconsistency Detection Model for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s00453-011-9512-7openalex-snapshot
Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/s10878-007-9124-yopenalex-snapshot
On minimum m-connected k-dominating set problem in unit disc graphs
inferred← citeshttps://doi.org/10.1007/s10878-013-9690-0openalex-snapshot
A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
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.1007/s11235-013-9760-8openalex-snapshot
A stable virtual backbone for wireless MANETS
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/s11276-014-0837-4openalex-snapshot
Approximating geographic routing using coverage tree heuristics for wireless network
inferred← citeshttps://doi.org/10.1007/s11277-012-0955-1openalex-snapshot
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks
inferred← citeshttps://doi.org/10.1007/s11277-021-08507-yopenalex-snapshot
Automata Theory-based Energy Efficient Area Algorithm for an Optimal Solution in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s11590-009-0151-8openalex-snapshot
Wireless networking, dominating and packing
inferred← citeshttps://doi.org/10.1007/s12243-017-0563-xopenalex-snapshot
Virtual coordinate system using dominating set for GPS-free adhoc networks
inferred← citeshttps://doi.org/10.1007/s13348-023-00412-wopenalex-snapshot
Connected domination in graphs and v-numbers of binomial edge ideals
inferred← citeshttps://doi.org/10.1016/j.adhoc.2012.03.021openalex-snapshot
An efficient reliable one-hop broadcast in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2013.03.002openalex-snapshot
An adaptive energy-efficient area coverage algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2016.02.003openalex-snapshot
Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.03.011openalex-snapshot
An adaptive backbone formation algorithm for wireless sensor networks
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.comnet.2009.10.007openalex-snapshot
An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata
inferred← citeshttps://doi.org/10.1016/j.comnet.2013.03.001openalex-snapshot
An energy-efficient topology construction algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2017.05.017openalex-snapshot
Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information
inferred← citeshttps://doi.org/10.1016/j.comnet.2018.09.016openalex-snapshot
A Novel Distributed algorithm for constructing virtual backbones in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2013.01.016openalex-snapshot
RETRACTED: Energy-efficient backbone formation in wireless sensor 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.ejor.2015.05.037openalex-snapshot
Minimum edge blocker dominating set problem
inferred← citeshttps://doi.org/10.1016/j.ins.2012.02.057openalex-snapshot
Finding minimum weight connected dominating set in stochastic graph based on learning automata
inferred← citeshttps://doi.org/10.1016/j.jda.2018.11.006openalex-snapshot
Complexity and lowers bounds for Power Edge Set Problem
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.06.002openalex-snapshot
Efficient disjoint boundary detection algorithm for surveillance capable WSNs
inferred← citeshttps://doi.org/10.1016/j.physa.2010.03.005openalex-snapshot
Rapid self-organised initiation of ad hoc sensor networks close above the percolation threshold
inferred← citeshttps://doi.org/10.1016/j.procs.2015.08.372openalex-snapshot
Distributed Computation of Connected Dominating Set for Multi-Hop Wireless Networks
inferred← citeshttps://doi.org/10.1016/j.sna.2012.06.032openalex-snapshot
Backbone formation in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.035openalex-snapshot
Algorithms for minimum m -connected k -tuple dominating set problem
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.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.1051/ro/2014040openalex-snapshot
On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
inferred← citeshttps://doi.org/10.1080/02533839.2026.2619711openalex-snapshot
A novel approximation algorithm for minimum virtual backbone problem in wireless sensor networks using cooperative communication
inferred← citeshttps://doi.org/10.1080/02533839.2026.2659786openalex-snapshot
Restoring 2-edge-connected m-edge dominating sets in unit disk graphs with failed edges
inferred← citeshttps://doi.org/10.1109/access.2019.2903920openalex-snapshot
Wireless Sensor Network MCDS Construction Algorithms With Energy Consideration for Extreme Environments Healthcare
inferred← citeshttps://doi.org/10.1109/aimoc.2014.6785527openalex-snapshot
A distributed greedy algorithm for construction of minimum connected dominating set in wireless sensor network
inferred← citeshttps://doi.org/10.1109/apscc.2011.84openalex-snapshot
ROB/CN: An Efficient Reliable 1-Hop Broadcast Using CSMA/CN in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/candar.2014.12openalex-snapshot
On Guha and Khuller's Greedy Algorithm for Finding a Minimum CDS for Unit Disk Graphs
inferred← citeshttps://doi.org/10.1109/coconet.2015.7411248openalex-snapshot
Randomized algorithms for approximating a Connected Dominating Set in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/cso.2011.110openalex-snapshot
Construction of 1- and 2-Connected k-Totally Dominating Set in Disk Graph
inferred← citeshttps://doi.org/10.1109/glocom.2011.6133526openalex-snapshot
Distributed Low Redundancy Broadcast for Uncoordinated Duty-Cycled WANETs
inferred← citeshttps://doi.org/10.1109/icaict.2016.7991751openalex-snapshot
A better heuristic for the minimum connected dominating set in ad hoc networks
inferred← citeshttps://doi.org/10.1109/icc.2009.5199026openalex-snapshot
Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2008.15openalex-snapshot
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2008.39openalex-snapshot
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00041openalex-snapshot
The Energy-Data Dual Coverage in Battery-free Sensor Networks
inferred← citeshttps://doi.org/10.1109/icmtma.2009.33openalex-snapshot
Construction of a Fault Tolerance Connected Dominating Set in Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/icpads.2013.57openalex-snapshot
A Distributed Approach to Constructing k-Hop Connected Dominating Set in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icsess.2015.7339105openalex-snapshot
A distributed algorithm to constructing weighted minimum connected dominating set for routing in mobile wireless network
inferred← citeshttps://doi.org/10.1109/idap64064.2024.10710712openalex-snapshot
Obtaining the Dominating Set in Graphs with the Invasive Weed Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/iisa.2019.8900750openalex-snapshot
Constructing Virtual Backbones over Low-Cost Wireless Networks for Smart Tourism Services
inferred← citeshttps://doi.org/10.1109/imis.2016.71openalex-snapshot
On the Robust Approach to Data Inconsistency Detection of Sensor Networks
inferred← citeshttps://doi.org/10.1109/indiacom.2014.6828049openalex-snapshot
Network connectivity maintenance of WSNs in node failure-prone environment: A detailed survey
inferred← citeshttps://doi.org/10.1109/infcom.2011.5934967openalex-snapshot
Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567021openalex-snapshot
A localized backbone renovating algorithm for wireless ad hoc and sensor networks
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524456openalex-snapshot
Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524504openalex-snapshot
Adaptive connected dominating set discovering algorithm in energy-harvest sensor networks
inferred← citeshttps://doi.org/10.1109/infocom.2017.8057225openalex-snapshot
Constructing a self-stabilizing CDS with bounded diameter in wireless networks under SINR
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485808openalex-snapshot
Coverage in Battery-Free Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/isccsp.2014.6877948openalex-snapshot
Load balanced connected dominating set for mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/isncc.2015.7238569openalex-snapshot
CDS based reliable topology control in WSNs
inferred← citeshttps://doi.org/10.1109/iwcmc.2015.7289181openalex-snapshot
Prolonging stability period of CDS based WSNs
inferred← citeshttps://doi.org/10.1109/jsen.2014.2329735openalex-snapshot
Cooperative Approaches to Construction and Maintenance of Networks’ Virtual Backbones for Extreme Wireless Sensor Applications
inferred← citeshttps://doi.org/10.1109/lcomm.2006.1603363openalex-snapshot
Connected dominating sets in disk graphs with bidirectional links
inferred← citeshttps://doi.org/10.1109/milcom.2007.4454774openalex-snapshot
Constructing k-Connected m-Dominating Sets in 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/smc.2013.467openalex-snapshot
Distributed Algorithm for Connected Dominating Set Construction in Sensor Networks
inferred← citeshttps://doi.org/10.1109/snpd.2014.6888704openalex-snapshot
An energy balanced topology construction protocol for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tc.2013.77openalex-snapshot
Constructing Connected-Dominating-Set with Maximum Lifetime in Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2883457openalex-snapshot
Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information
inferred← citeshttps://doi.org/10.1109/tcomm.2020.3030930openalex-snapshot
Constructing d-Robust Connected Dominating Sets in Wireless Sensor Networks With Unstable Transmission Ranges
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3524945openalex-snapshot
Construction of Virtual Backbones With Edge Fault Tolerance in Wireless Networks With Multiple Communication Modes
inferred← citeshttps://doi.org/10.1109/tgcn.2022.3175035openalex-snapshot
Sustainable Maintenance of Connected Dominating Set by Solar Energy Harvesting for IoT Networks
inferred← citeshttps://doi.org/10.1109/tmc.2007.1034openalex-snapshot
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
inferred← citeshttps://doi.org/10.1109/tmc.2008.22openalex-snapshot
On Construction of Virtual Backbone in Wireless Ad Hoc Networks with Unidirectional Links
inferred← citeshttps://doi.org/10.1109/tmc.2010.244openalex-snapshot
Timer-Based CDS Construction in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tmc.2012.58openalex-snapshot
Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges
inferred← citeshttps://doi.org/10.1109/tmc.2020.3019470openalex-snapshot
A Novel Framework for the Coverage Problem in Battery-Free Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2017.2657688openalex-snapshot
Exploring Connected Dominating Sets in Energy Harvest Networks
inferred← citeshttps://doi.org/10.1109/tnet.2017.2740328openalex-snapshot
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network
inferred← citeshttps://doi.org/10.1109/tnse.2021.3103873openalex-snapshot
Adaptive $ D$-Hop Connected Dominating Set in Highly Dynamic Flying Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2025.3606864openalex-snapshot
Efficient Optimization Algorithm for Virtual Backbone in Wireless Sensor Networks by Removing Redundant Dominators
inferred← citeshttps://doi.org/10.1109/tnsm.2026.3686606openalex-snapshot
Construction and Post-Failure Reconstruction of Virtual Backbone Based on Regional Risk Difference in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2008.13openalex-snapshot
Efficient Algorithms for p-Self-Protection Problem in Static Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2009.78openalex-snapshot
Minimum Connected Dominating Set Using a Collaborative Cover Heuristic for Ad Hoc Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2012.177openalex-snapshot
CDS-Based Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tvt.2009.2030203openalex-snapshot
Minimum-Transmission Broadcast in Uncoordinated Duty-Cycled Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/twc.2009.051053openalex-snapshot
On the construction of 2-connected virtual backbone in wireless networks
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.1109/wcnc.2008.387openalex-snapshot
Broadcast Routing and Channel Selection in Multi-Radio Wireless Mesh Networks
inferred← citeshttps://doi.org/10.1109/wcnc.2011.5779233openalex-snapshot
An improved greedy construction of minimum connected dominating sets in wireless networks
inferred← citeshttps://doi.org/10.1109/wcnc.2017.7925789openalex-snapshot
Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information
inferred← citeshttps://doi.org/10.1109/wimob.2012.6379076openalex-snapshot
Minimum 2-connected distance-k p-dominating set in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/wisee.2013.6737547openalex-snapshot
A distributed self-healing algorithm for virtual backbone construction and maintenance in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/wts.2014.6835020openalex-snapshot
Many-to-all priority-based network-coding broadcast in wireless multihop 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/s0129054116500325openalex-snapshot
On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs
inferred← citeshttps://doi.org/10.1142/s1793830909000348openalex-snapshot
EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
inferred← citeshttps://doi.org/10.1142/s1793830909000361openalex-snapshot
TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
inferred← citeshttps://doi.org/10.1142/s1793830911000961openalex-snapshot
ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM
inferred← citeshttps://doi.org/10.1145/1288107.1288111openalex-snapshot
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges
inferred← citeshttps://doi.org/10.1145/2811411.2811487openalex-snapshot
An algorithm on constructing routing-based multiple CDSs to prolong lifetime of WSN
inferred← citeshttps://doi.org/10.1145/3352486openalex-snapshot
Dominating Sets Construction in RF-based Battery-free Sensor Networks with Full Coverage Guarantee
inferred← citeshttps://doi.org/10.1155/2014/625061openalex-snapshot
Distributed Energy-Efficient Approaches for Connected Dominating Set Construction in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2015/612102openalex-snapshot
Improved Route Discovery Based on Constructing Connected Dominating Set in MANET
inferred← citeshttps://doi.org/10.1155/2015/842346openalex-snapshot
An Optimal CDS Construction Algorithm with Activity Scheduling in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1155/2021/5977781openalex-snapshot
Construction of Quality Virtual Backbones with Link Fault Tolerance in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1177/155014771703201openalex-snapshot
A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network
inferred← citeshttps://doi.org/10.1186/1687-1499-2012-83openalex-snapshot
An energy efficient MCDS construction algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1186/s13638-018-1068-7openalex-snapshot
A novel centralized algorithm for constructing virtual backbones in wireless sensor networks
inferred← citeshttps://doi.org/10.12720/jcm.11.1.50-57openalex-snapshot
Connected Dominating Set Construction Algorithm for Wireless Networks Based on Connected Subset
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0776openalex-snapshot
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
inferred← citeshttps://doi.org/10.14257/ijgdc.2014.7.1.12openalex-snapshot
Energy Efficient Backbone Formation Using Particle Swarm Optimization Algorithm in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1504/ijsnet.2007.012984openalex-snapshot
A distributed algorithm for constructing energy-balanced connected dominating set in wireless sensor networks
inferred← citeshttps://doi.org/10.1504/ijsnet.2012.046331openalex-snapshot
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
inferred← citeshttps://doi.org/10.1504/ijsnet.2013.053719openalex-snapshot
Connected dominating set algorithms for wireless sensor networks
inferred← citeshttps://doi.org/10.17771/pucrio.acad.34169openalex-snapshot
MATHEURISTICS FOR VARIANTS OF THE DOMINATING SET PROBLEM
inferred← citeshttps://doi.org/10.2174/978160805018510901010019openalex-snapshot
Connected Dominating Sets
inferred← citeshttps://doi.org/10.22215/etd/2008-06271openalex-snapshot
Approximation algorithms for geometric networks
inferred← citeshttps://doi.org/10.26180/4664107openalex-snapshot
Distributed connected dominating set techniques for energy-efficient topology control in wireless sensor networks.
inferred← citeshttps://doi.org/10.26756/th.2011.59openalex-snapshot
A low degree vertex elimination with high degree vertex selection heuristic for strongly connected dominating and absorbent sets in wireless Ad-Hoc networks. (c2011)
inferred← citeshttps://doi.org/10.2991/ameii-15.2015.192openalex-snapshot
An improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET
inferred← citeshttps://doi.org/10.3390/app14209251openalex-snapshot
MDSA: A Dynamic and Greedy Approach to Solve the Minimum Dominating Set Problem
inferred← citeshttps://doi.org/10.3390/s19081919openalex-snapshot
Minimum Connected Dominating Set Algorithms for Ad Hoc Sensor Networks
inferred← citeshttps://doi.org/10.3390/s23187831openalex-snapshot
TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs
inferred← citeshttps://doi.org/10.35378/gujs.1243008openalex-snapshot
Efficient Algorithm for Dominatig Set In Graph Theory Based on Fundamental Cut-Set
inferred← citeshttps://doi.org/10.3923/itj.2010.864.876openalex-snapshot
Approximation Two Independent Sets Based Connected Dominating Set Construction Algorithm for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.4018/978-1-4666-0321-9.ch002openalex-snapshot
Multicast Routing Protocols in MANET
inferred← citeshttps://doi.org/10.4018/978-1-5225-7335-7.ch017openalex-snapshot
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
inferred← citeshttps://doi.org/10.4018/jaras.2012040104openalex-snapshot
Management Scheme for Data Collection within Wireless Sensor Networks
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.764-765.929openalex-snapshot
On the Performance of Weakly Connected Dominating Set and Loosely Coupled Dominating Set for Wireless Sensor/Mesh Networks
inferred← citeshttps://doi.org/10.4108/eai.13-7-2018.159944openalex-snapshot
Node Credit Based Efficient Flooding (NCBEF) Method for Mobile Ad-hoc Networks
inferred← citeshttps://doi.org/10.4236/ijcns.2011.44025openalex-snapshot
Forwarding vs. Network Coding: Efficient Broadcasting in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.48161/qaj.v1n1a41openalex-snapshot
Complexity of Computation of Dominating Sets in Geo-Mathmetics Algorithm : A Review
inferred← citeshttps://doi.org/10.48550/arxiv.1608.07634openalex-snapshot
Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set
inferred← citeshttps://doi.org/10.5120/18948-0040openalex-snapshot
Constructing MICDS Algorithm for Data Transmission using Maximal Independent Set in Network Graph
inferred← citeshttps://doi.org/10.5120/20033-2136openalex-snapshot
Results and Performance analysis of an Efficient Reliable One Hop Broadcast in Mobile Adhoc Networks
inferred← citeshttps://doi.org/10.5815/ijitcs.2012.02.05openalex-snapshot
Algorithmic aspects for total connected dominating sets in Mobile Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.7232/iems.2011.10.3.221openalex-snapshot
An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network
inferred← citeshttps://doi.org/10.7763/ijfcc.2014.v3.315openalex-snapshot
An Area-Based WCDS-Induced Routing Protocol for Large-Scale Wireless Sensor/Mesh 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.