Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 293

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

Mini, S., Udgata, Siba K., Sabat, Samrat L.·2014·IEEE Sensors Journal

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jsen.2013.2286332

Cites

17 of 17 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 17 references

Cited by

See all 293

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.