On the public citation graph
Application of Evolutionary Algorithms to Maximum Lifetime Coverage Problem in Wireless Sensor Networks
0 signed · 28 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.1007/978-1-84996-059-5openalex-snapshot
Coverage Control in Sensor Networks
inferredcites →https://doi.org/10.1007/978-3-540-70666-3_10openalex-snapshot
Coverage Problem of Wireless Sensor Networks
inferredcites →https://doi.org/10.1016/s1389-1286(01)00302-4openalex-snapshot
Wireless sensor networks: a survey
inferredcites →https://doi.org/10.1109/hicss.2000.926982openalex-snapshot
Energy-efficient communication protocol for wireless microsensor networks
inferredcites →https://doi.org/10.1109/ipdpsw.2010.5470705openalex-snapshot
A bio-inspired coverage-aware scheduling scheme for wireless sensor networks
inferredcites →https://doi.org/10.1109/tc.2009.166openalex-snapshot
A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tc.2009.170openalex-snapshot
Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tc.2010.227openalex-snapshot
Target Association Rules: A New Behavioral Patterns for Point of Coverage Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tpds.2009.112openalex-snapshot
Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks
inferredcites →https://doi.org/10.1109/tpds.2010.124openalex-snapshot
Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks
inferredcites →https://doi.org/10.1145/570738.570744openalex-snapshot
A coverage-preserving node scheduling scheme for large wireless sensor networks
inferredcites →https://doi.org/10.1145/570743.570744openalex-snapshot
A coverage-preserving node scheduling scheme for large wireless sensor networks
inferredcites →https://doi.org/10.3390/s90604918openalex-snapshot
CoCMA: Energy-Efficient Coverage Control in Cluster-Based Wireless Sensor Networks Using a Memetic Algorithm
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_41openalex-snapshot
Local Search Approaches with Different Problem-Specific Steps for Sensor Network Coverage Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-11520-7_45openalex-snapshot
Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-67074-4_40openalex-snapshot
Sensor Network Coverage Problem: A Hypergraph Model Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-67074-4_41openalex-snapshot
Heuristic Optimization of a Sensor Network Lifetime Under Coverage Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-67074-4_43openalex-snapshot
Scheduling Sensors Activity in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-78054-2_40openalex-snapshot
Application of Local Search with Perturbation Inspired by Cellular Automata for Heuristic Optimization of Sensor Network Coverage Problem
inferred← citeshttps://doi.org/10.1007/s12065-024-00916-9openalex-snapshot
A heuristic node placement strategy for extending network lifetime and ensuring target coverage in mobile wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2019.101994openalex-snapshot
Maximization of the sensor network lifetime by activity schedule heuristic optimization
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.56openalex-snapshot
Graph-Based Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/3132114.3132119openalex-snapshot
Heuristic and Meta-Heuristic Approaches for Energy-Efficient Coverage-Preserving Protocols in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2022/3745358openalex-snapshot
Wireless Sensor Network Coverage Optimization: Comparison of Local Search-Based Heuristics
inferred← citeshttps://doi.org/10.1177/0037549715612579openalex-snapshot
Graph Cellular Automata approach to the Maximum Lifetime Coverage Problem in wireless sensor networks
inferred← citeshttps://doi.org/10.29007/gl61openalex-snapshot
Simulated Annealing Application to Maximum Lifetime Coverage Problem in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3390/a15100351openalex-snapshot
Evolutionary Approaches to the Identification of Dynamic Processes in the Form of Differential Equations and Their Systems
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.