On the public citation graph
Greedy construction of load‐balanced virtual backbones in wireless sensor networks
0 signed · 62 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.492openalex-snapshot
Load balance and energy efficient data gathering in wireless sensor networks
inferredcites →https://doi.org/10.1007/978-3-540-88582-5_18openalex-snapshot
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph
inferredcites →https://doi.org/10.1007/978-3-642-10631-6_71openalex-snapshot
Tighter Approximation Bounds for Minimum CDS 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/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1016/c2013-0-06082-3openalex-snapshot
Computer-Communication Networks
inferredcites →https://doi.org/10.1016/j.jpdc.2005.12.010openalex-snapshot
On constructing k-connected k-dominating set in wireless ad hoc and 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.1023/b:mone.0000013625.87793.13openalex-snapshot
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1109/cse.2011.30openalex-snapshot
The Analysis of Load Balance for Wireless Sensor Network Using Compressive Sensing
inferredcites →https://doi.org/10.1109/icc.2006.255708openalex-snapshot
Connected Dominating Set Based Hybrid Routing Algorithm in Ad Hoc Networks with Obstacles
inferredcites →https://doi.org/10.1109/icc.2008.462openalex-snapshot
Multi-Initiator Connected Dominating Set Construction for Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/icc.2009.5198616openalex-snapshot
A High Throughput Load Balance Algorithm for Multichannel Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/icdcs.2008.15openalex-snapshot
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
inferredcites →https://doi.org/10.1109/icdcs.2009.67openalex-snapshot
On the Connected k-Coverage Problem in Heterogeneous Sensor Nets: The Curse of Randomness and Heterogeneity
inferredcites →https://doi.org/10.1109/icdcs.2010.17openalex-snapshot
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
inferredcites →https://doi.org/10.1109/iceee.2010.5661337openalex-snapshot
A Load Balance Clustering Algorithm for Heterogeneous Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/infcom.2010.5462105openalex-snapshot
A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks
inferredcites →https://doi.org/10.1109/infcom.2011.5934880openalex-snapshot
Capacity of dual-radio multi-channel wireless sensor networks for continuous data collection
inferredcites →https://doi.org/10.1109/infcom.2011.5935108openalex-snapshot
A framework for mobile data gathering with load balanced clustering and MIMO uploading
inferredcites →https://doi.org/10.1109/infocom.2008.77openalex-snapshot
A p-norm Flow Optimization Problem in Dense Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/mass.2011.29openalex-snapshot
Continuous Data Collection Capacity of Wireless Sensor Networks under Physical Interference Model
inferredcites →https://doi.org/10.1109/milcom.2011.6127751openalex-snapshot
Genetic-algorithm-based construction of Load-Balanced CDSs in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/pccc.2011.6108063openalex-snapshot
Minimum latency scheduling for Multi-Regional Query in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/percom.2009.4912860openalex-snapshot
Energy-efficient connected d-hop dominating sets in wireless sensor 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.1109/saint.2005.9openalex-snapshot
A Timer-based Protocol for Connected Dominating Set Construction in IEEE 802.11 Multihop Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/snpa.2003.1203353openalex-snapshot
Multi-resolution state retrieval in sensor networks
inferredcites →https://doi.org/10.1109/tit.2004.828055openalex-snapshot
A Deterministic Approach to Throughput Scaling in Wireless Networks
inferredcites →https://doi.org/10.1109/tmc.2008.128openalex-snapshot
Rotation of CDS via Connected Domatic Partition in Ad Hoc Sensor Networks
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.1109/tpds.2008.74openalex-snapshot
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
inferredcites →https://doi.org/10.1109/tvt.2009.2013354openalex-snapshot
On Efficient Network Planning and Routing in Large-Scale MANETs
inferredcites →https://doi.org/10.1109/tvt.2009.2038167openalex-snapshot
On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas
inferredcites →https://doi.org/10.1109/twc.2009.051053openalex-snapshot
On the construction of 2-connected virtual backbone in wireless networks
inferredcites →https://doi.org/10.1142/s1793830909000105openalex-snapshot
ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
inferredcites →https://doi.org/10.1145/1530748.1530773openalex-snapshot
Minimum-latency aggregation scheduling in multihop wireless networks
inferredcites →https://doi.org/10.1145/1641776.1641791openalex-snapshot
Blackbone2, an efficient deterministic algorithm for creating 2-connected m-dominating set-based backbones in ad hoc networks
inferredcites →https://doi.org/10.1145/1755743.1755749openalex-snapshot
Message ferries as generalized dominating sets in intermittently connected mobile 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.3390/s90705173openalex-snapshot
On Connected Target Coverage for Wireless Heterogeneous Sensor Networks with Multiple Sensing Units
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.1002/wcm.2718openalex-snapshot
A distributed battery recovery aware topology control algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_1openalex-snapshot
Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s11277-016-3725-7openalex-snapshot
Network Coding Based Converge-Cast Scheme in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s11277-019-06223-2openalex-snapshot
A Grey Wolf Optimization Approach for Improving the Performance of Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.aeue.2019.05.018openalex-snapshot
A balanced energy efficient virtual backbone construction algorithm in wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.061openalex-snapshot
A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks
inferred← citeshttps://doi.org/10.1109/glocom.2013.6831081openalex-snapshot
A Multi-Objective Genetic Algorithm for constructing load-balanced virtual backbones in probabilistic Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/iaeac47372.2019.8997653openalex-snapshot
A Multi-Dominating-Subtree-based Minimum Connected Dominating Set Construction Algorithm
inferred← citeshttps://doi.org/10.1109/iccsp.2018.8524287openalex-snapshot
A Distributed Algorithm for Virtual Backbone Construction in Wireless Networks
inferred← citeshttps://doi.org/10.1109/iscc.2017.8024705openalex-snapshot
Construction of a minimum energy broadcast backbone with bounded delay in heterogeneous wireless sensor networks
inferred← citeshttps://doi.org/10.1109/tmc.2013.30openalex-snapshot
Snapshot and Continuous Data Collection in Probabilistic Wireless Sensor Networks
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/wispnet.2017.8300107openalex-snapshot
Identification of data aggregators in wireless sensor network
inferred← citeshttps://doi.org/10.1177/155014774979142openalex-snapshot
Clustering Analysis in Wireless Sensor Networks: The Ambit of Performance Metrics and Schemes Taxonomy
inferred← citeshttps://doi.org/10.1504/ijsnet.2013.053719openalex-snapshot
Connected dominating set algorithms for wireless sensor networks
inferred← citeshttps://doi.org/10.57709/4190499openalex-snapshot
Data Collection and Capacity Analysis in Large-scale Wireless Sensor 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.