On the public citation graph
Maximizing the Lifetime of Dominating Sets
0 signed · 117 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.1006/jagm.1998.0929openalex-snapshot
Fast Distributed Construction of Smallk-Dominating Sets and Applications
inferredcites →https://doi.org/10.1007/3-540-61680-2_55openalex-snapshot
Approximation algorithms for connected dominating sets
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1017/s00446-002-0078-0openalex-snapshot
An efficient distributed algorithm for constructing small dominating sets
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/icc.2001.936985openalex-snapshot
Power efficient organization of wireless sensor networks
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/s0097539700380754openalex-snapshot
Approximating theDomatic Number
inferredcites →https://doi.org/10.1137/s0895480196311328openalex-snapshot
A Study on r -Configurations---A Resource Assignment Problem on Graphs
inferredcites →https://doi.org/10.1142/s021926590200063xopenalex-snapshot
Wireless Sensor Networks with Energy Efficient Organization
inferredcites →https://doi.org/10.1145/1011767.1011811openalex-snapshot
What cannot be computed locally!
inferredcites →https://doi.org/10.1145/1023720.1023746openalex-snapshot
Initializing newly deployed ad hoc and sensor networks
inferredcites →https://doi.org/10.1145/185675.306789openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
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/313239.313263openalex-snapshot
Unidirectional links prove costly in wireless ad hoc networks
inferredcites →https://doi.org/10.1145/513800.513820openalex-snapshot
Message-optimal connected dominating sets in mobile ad hoc networks
inferredcites →https://doi.org/10.1145/872035.872040openalex-snapshot
Constant-time distributed dominating set approximation
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.750openalex-snapshot
Joint optimization of energy allocation and routing problems in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_24openalex-snapshot
A Unified Approach for Domination Problems on Different Network Topologies
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-319-07782-6_35openalex-snapshot
2-m-Domatic Partition in Homogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77871-4_10openalex-snapshot
Local Approximation Algorithms for Scheduling Problems in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-92295-7_39openalex-snapshot
Q-Coverage Problem in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02085-8_25openalex-snapshot
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_4openalex-snapshot
Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_24openalex-snapshot
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_44openalex-snapshot
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-642-13651-1_11openalex-snapshot
Building (1 − ε) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-981-10-0448-3_65openalex-snapshot
Critical Analysis of Clustering Algorithms for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s10922-015-9342-zopenalex-snapshot
Phenomena Detection in Mobile Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.02.009openalex-snapshot
Sleep scheduling for wireless sensor networks via network flow model
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.05.024openalex-snapshot
A survey on clustering algorithms for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.05.034openalex-snapshot
PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.06.004openalex-snapshot
The optimum sensor redeployment scheme using the most frangible clusters set
inferred← citeshttps://doi.org/10.1016/j.comcom.2009.12.001openalex-snapshot
The optimization of sensor relocation in wireless mobile sensor networks
inferred← citeshttps://doi.org/10.1016/j.comcom.2011.06.002openalex-snapshot
Optimal network locality in distributed virtualized data-centers
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.02.013openalex-snapshot
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
inferred← citeshttps://doi.org/10.1016/j.jnca.2013.02.025openalex-snapshot
Domatic partition in homogeneous wireless sensor networks
inferred← citeshttps://doi.org/10.1080/00207217.2017.1292554openalex-snapshot
Modulation aware cluster size optimisation in wireless sensor networks
inferred← citeshttps://doi.org/10.1080/1206212x.2009.11441952openalex-snapshot
Adaptive and Energy-Efficient Clustering Architecture for Dynamic Sensor Networks
inferred← citeshttps://doi.org/10.1080/17445760.2010.537277openalex-snapshot
A local algorithm to compute multiple connected dominating sets in wireless sensor networks
inferred← citeshttps://doi.org/10.1080/17445760.2012.729584openalex-snapshot
Energy-efficient distributed wireless sensor network scheme for cluster detection
inferred← citeshttps://doi.org/10.1109/aiccsa63423.2024.10912600openalex-snapshot
Federated Learning in Clustered WSN for Natural Disaster Management
inferred← citeshttps://doi.org/10.1109/comswa.2007.382473openalex-snapshot
ClusterHead Rotation via Domatic Partition in Self-Organizing Sensor Networks
inferred← citeshttps://doi.org/10.1109/glocom.2007.222openalex-snapshot
Resource Efficient Survivable Clustering for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/hipc.2009.5433213openalex-snapshot
Taming the exponential state space of the maximum lifetime sensor cover problem
inferred← citeshttps://doi.org/10.1109/i-span.2012.17openalex-snapshot
Monitoring Schedules for Randomly Deployed Sensor Networks Without Geographic Information
inferred← citeshttps://doi.org/10.1109/ibcast.2018.8312331openalex-snapshot
Evaluation of clustering algorithms for wireless sensor and actor networks
inferred← citeshttps://doi.org/10.1109/iih-msp.2007.232openalex-snapshot
Optimal Deployment for Wireless Sensor Networks Using Lifetime Expectation Estimation
inferred← citeshttps://doi.org/10.1109/iih-msp.2014.186openalex-snapshot
Self-Stabilizing Distributed Formation of Minimal k-Dominating Sets in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/infocom.2006.295openalex-snapshot
Analyzing the Energy-Latency Trade-Off During the Deployment of Sensor Networks
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218497openalex-snapshot
The online disjoint set cover problem and its applications
inferred← citeshttps://doi.org/10.1109/ipsn.2008.14openalex-snapshot
High Performance Sleep-Wake Sensor Systems Based on Cyclic Cellular Automata
inferred← citeshttps://doi.org/10.1109/isda.2008.264openalex-snapshot
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/iswpc.2007.342660openalex-snapshot
Coordinator Rotation via Domatic Partition in Self-Organizing Sensor Networks
inferred← citeshttps://doi.org/10.1109/lcn.2009.5355161openalex-snapshot
Maximizing the lifetime of wireless sensor networks through domatic partition
inferred← citeshttps://doi.org/10.1109/mass56207.2022.00012openalex-snapshot
Association of IoT Devices Using Fuzzy C-Means Clustering and Apriori Algorithms
inferred← citeshttps://doi.org/10.1109/netcom.2009.56openalex-snapshot
Neural Network Based Energy Efficient Clustering and Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644642openalex-snapshot
A Self-Stabilizing Algorithm for Two Disjoint Minimal Dominating Sets with Safe Convergence
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/percom.2009.4912860openalex-snapshot
Energy-efficient connected d-hop dominating sets in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/sahcn.2007.4292827openalex-snapshot
A distributed approximation scheme for sleep sceduling in sensor networks
inferred← citeshttps://doi.org/10.1109/saso.2008.15openalex-snapshot
Self-Organizing Sleep-Wake Sensor Systems
inferred← citeshttps://doi.org/10.1109/sofa.2007.4318333openalex-snapshot
Adaptive and Energy Efficient Clustering Architecture for Dynamic Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2009.2022936openalex-snapshot
Coverage-Time Optimization for Clustered Wireless Sensor Networks: A Power-Balancing Approach
inferred← citeshttps://doi.org/10.1109/tnse.2017.2734048openalex-snapshot
Scheduling Resource-Bounded Monitoring Devices for Event Detection and Isolation in Networks
inferred← citeshttps://doi.org/10.1109/tsmc.2018.2824900openalex-snapshot
Performance Optimization of Reconfigurable Real-Time Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/waina.2014.46openalex-snapshot
Deployment Challenges and Developments in Wireless Sensor Networks Clustering
inferred← citeshttps://doi.org/10.1109/waina.2014.47openalex-snapshot
On Demand Multicast Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1137/1.9781611972900.10openalex-snapshot
Employing (1 − ∊) Dominating Set Partitions as Backbones in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973037.4openalex-snapshot
Approximating Fault-Tolerant Domination in General Graphs
inferred← citeshttps://doi.org/10.1145/1062689.1062693openalex-snapshot
On the node-scheduling approach to topology control in ad hoc networks
inferred← citeshttps://doi.org/10.1145/1062689.1062705openalex-snapshot
Power balanced coverage-time optimization for clustered wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1062689.1062732openalex-snapshot
Low-coordination topologies for redundancy in sensor networks
inferred← citeshttps://doi.org/10.1145/1062689.1062738openalex-snapshot
Minimum power configuration in wireless sensor networks
inferred← citeshttps://doi.org/10.1145/1062689.1062742openalex-snapshot
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas
inferred← citeshttps://doi.org/10.1145/1132905.1132922openalex-snapshot
Energy conservation via domatic partitions
inferred← citeshttps://doi.org/10.1145/1240226.1240231openalex-snapshot
Minimum power configuration for wireless communication in sensor networks
inferred← citeshttps://doi.org/10.1145/1267060.1267063openalex-snapshot
Asynchronous random sleeping for sensor networks
inferred← citeshttps://doi.org/10.1145/1374718.1374722openalex-snapshot
Power efficient resilience and lifetime in wireless ad-hoc networks
inferred← citeshttps://doi.org/10.1145/1400863.1400866openalex-snapshot
Monitoring schedules for randomly deployed sensor networks
inferred← citeshttps://doi.org/10.1145/2808705.2808711openalex-snapshot
Scheduling Intrusion Detection Systems in Resource-Bounded Cyber-Physical Systems
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/3717823.3718184openalex-snapshot
Disjoint Connected Dominating Sets in Pseudorandom Graphs
inferred← citeshttps://doi.org/10.1155/2011/257156openalex-snapshot
Survivable Self-Organization for Prolonged Lifetime in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2013/109307openalex-snapshot
A Hybrid Energy- and Time-Driven Cluster Head Rotation Strategy for Distributed Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2013/564386openalex-snapshot
A Nonuniform Sensor Distribution Strategy for Avoiding Energy Holes in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.11606/d.55.2012.tde-18022013-162410openalex-snapshot
Técnica de agrupamento de dados baseada em redes complexas para o posicionamento de cluster heads em rede de sensores sem fio
inferred← citeshttps://doi.org/10.1504/ijsnet.2009.023314openalex-snapshot
Low-coordination wake-up algorithms for multiple connected-covered topologies in sensor nets
inferred← citeshttps://doi.org/10.1504/ijsnet.2013.053719openalex-snapshot
Connected dominating set algorithms for wireless sensor networks
inferred← citeshttps://doi.org/10.22215/etd/2008-06271openalex-snapshot
Approximation algorithms for geometric networks
inferred← citeshttps://doi.org/10.2316/journal.202.2009.4.202-2743openalex-snapshot
ADAPTIVE AND ENERGY-EFFICIENT CLUSTERING ARCHITECTURE FOR DYNAMIC SENSOR NETWORKS
inferred← citeshttps://doi.org/10.3390/a14060170openalex-snapshot
A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets
inferred← citeshttps://doi.org/10.3929/ethz-a-005026927openalex-snapshot
Networking Unleashed: Geographic Routing and Topology Control in Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.3929/ethz-b-000379990openalex-snapshot
Robust Global Localization Using GPS and Aircraft Signals
inferred← citeshttps://doi.org/10.48550/arxiv.1108.0747openalex-snapshot
A Fault Tolerant Trajectory Clustering (FTTC) for selecting cluster heads inWireless Sensor Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4308openalex-snapshot
Connected Domatic Packings in Node-capacitated Graphs
inferred← citeshttps://doi.org/10.5120/709-996openalex-snapshot
Frequency Reliance on EEHC-Based Routed Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5121/jgraphhoc.2010.2105openalex-snapshot
Coverage and Connectivity Aware Neural Network Based Energy Efficient Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5220/0004711901810187openalex-snapshot
A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.5555/2163970.2163981openalex-snapshot
Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring
inferred← citeshttps://doi.org/10.5772/48575openalex-snapshot
Maximum Lifetime Scheduling in 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.