The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks
Abstract
Network lifetime plays an integral role in setting up an efficient wireless sensor network. The objective of this paper is twofold. The first one is to deploy sensor nodes at optimal locations such that the theoretically computed network lifetime is maximum. The second is to schedule these sensor nodes such that the network attains the maximum lifetime. Thus, the overall objective of this paper is to identify optimal deployment locations of the given sensor nodes with a pre-specified sensing range, and to schedule them such that the network lifetime is maximum with the required coverage level. Since the upper bound of the network lifetime for a given network can be computed mathematically, we use this knowledge to compute locations of deployment such that the network lifetime is maximum. Further, the nodes are scheduled to achieve this upper bound. In this paper, we use artificial bee colony algorithm and particle swarm optimization for sensor deployment problem followed by a heuristic for scheduling. A comparative study shows that artificial bee colony algorithm performs better for sensor deployment problem. The proposed heuristic was able to achieve the theoretical upper bound in all the experimented cases.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Wireless sensor network survey
Yick, J., Mukherjee, B., & Ghosal, D. (2008) · Computer Networks · doi:10.1016/j.comnet.2008.04.002 · Cited by 6,255
On the performance of artificial bee colony (ABC) algorithm
Karaboga, D., & Basturk, B. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.05.007 · Cited by 3,672
Sensor networks: Evolution, opportunities, and challenges
Chong, C.-Y., & Kumar, S. P. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.814918 · Cited by 3,079
A comprehensive survey: artificial bee colony (ABC) algorithm and applications
Karaboga, D., Gorkemli, B., Ozturk, C., & Karaboga, N. (2014) · Artificial Intelligence Review · doi:10.1007/s10462-012-9328-0 · Cited by 1,975
A taxonomy of wireless micro-sensor network models
Tilak, S., Abu-Ghazaleh, N. B., & Heinzelman, W. (2002) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/565702.565708 · Cited by 1,012
The coverage problem in a wireless sensor network
Huang, C.-F., & Tseng, Y.-C. (2003) · Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications · doi:10.1145/941350.941367 · Cited by 807
A survey: algorithms simulating bee swarm intelligence
Karaboga, D., & Akay, B. (2009) · Artificial Intelligence Review · doi:10.1007/s10462-009-9127-4 · Cited by 646
The flight paths of honeybees recruited by the waggle dance
Riley, J. R., Greggers, U., Smith, A. D., Reynolds, D. R., & Menzel, R. (2005) · Nature · doi:10.1038/nature03526 · Cited by 489
Cited by
A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks
Yetgin, H., Cheung, K. T. K., El-Hajjar, M., & Hanzo, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2650979 · Cited by 627
Particle swarm optimization based clustering algorithm with mobile sink for WSNs
Wang, J., Cao, Y., Li, B., Kim, H.-J., & Lee, S. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2016.08.004 · Cited by 310
Metadata
- Authors
- Mini, S., Udgata, S. K., & Sabat, S. L.
- Venue
- IEEE Sensors Journal
- Published
- 2014-03
- Volume
- 14
- Issue
- 3
- Pages
- 636-644
- ISSN
- 1530-437X (ISSN-L)
- 1558-1748
- OpenAlex
- W1969476645
- Cited by
- 293
- References
- 17
- FWCI
- 33.04
- 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: Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks. https://app.cochat.ai/papers/10.1109/jsen.2013.2286332
- The paper
- Mini, S., Udgata, S. K., & Sabat, S. L. (2014). Sensor Deployment and Scheduling for Target Coverage Problem in Wireless Sensor Networks. IEEE Sensors Journal. https://doi.org/10.1109/jsen.2013.2286332
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.