The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks
Abstract
Sensor networks have a lot of applications such as battlefield surveillance, environmental monitoring, and industrial diagnostics. Coverage is one of the most important performance metrics for sensor networks since it reflects how well a sensor field is monitored. In this paper, we introduce the maximum coverage deployment problem in wireless sensor networks and analyze the properties of the problem and its solution space. Random deployment is the simplest way to deploy sensor nodes but may cause unbalanced deployment and therefore, we need a more intelligent way for sensor deployment. We found that the phenotype space of the problem is a quotient space of the genotype space in a mathematical view. Based on this property, we propose an efficient genetic algorithm using a novel normalization method. A Monte Carlo method is adopted to design an efficient evaluation function, and its computation time is decreased without loss of solution quality using a method that starts from a small number of random samples and gradually increases the number for subsequent generations. The proposed genetic algorithms could be further improved by combining with a well-designed local search. The performance of the proposed genetic algorithm is shown by a comparative experimental study. When compared with random deployment and existing methods, our genetic algorithm was not only about twice faster, but also showed significant performance improvement in quality.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
(1979) · Cited by 43,841
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1024422 · Cited by 13,644
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Burago, D., Burago, Y., & Ivanov, S. (2001) · Graduate Studies in Mathematics · doi:10.1090/gsm/033 · Cited by 2,598
Real-Coded Genetic Algorithms and Interval-Schemata
Eshelman, L. J., & Schaffer, J. D. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50018-0 · Cited by 1,650
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks
Zhang, H., & Hou, J. (2005) · Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks · doi:10.1201/9780203323687.ch28 · Cited by 1,500
Howard, A., Matarić, M. J., & Sukhatme, G. S. (2002) · Distributed Autonomous Robotic Systems 5 · doi:10.1007/978-4-431-65941-9_30 · Cited by 1,328
Sensor deployment and target localization based on virtual forces
Zou, Y., & Chakrabarty, K. (2003) · doi:10.1109/infcom.2003.1208965 · Cited by 1,034
Wireless sensor networks: applications and challenges of ubiquitous sensing
Puccinelli, D., & Haenggi, M. (2005) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2005.1507522 · Cited by 638
Cited by
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
Houssein, E. H., Saad, M. R., Hashim, F. A., Shaban, H., & Hassaballah, M. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103731 · Cited by 499
Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems
Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2675628 · Cited by 425
Intelligent Particle Filter and Its Application on Fault Detection of Nonlinear System
Yin, S., & zhu, X. (2015) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2015.2399396 · Cited by 367
The Sensable City: A Survey on the Deployment and Management for Smart City Monitoring
Du, R., Santi, P., Xiao, M., Vasilakos, A. V., & Fischione, C. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2881008 · Cited by 289
Metadata
- Authors
- Yoon, Y., & Kim, Y.-H.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2013-10
- Volume
- 43
- Issue
- 5
- Pages
- 1473-1483
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2078927150
- Cited by
- 343
- References
- 18
- FWCI
- 36.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks. https://app.cochat.ai/papers/10.1109/tcyb.2013.2250955
- The paper
- Yoon, Y., & Kim, Y.-H. (2013). An Efficient Genetic Algorithm for Maximum Coverage Deployment in Wireless Sensor Networks. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2013.2250955
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.