The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
On k-coverage in a mostly sleeping sensor network
Abstract
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their lifetime. On the other hand, surveillance kind of applications require guaranteed k-coverage of the protected region at all times. As a result, determining the appropriate number of sensors to deploy that achieves both goals simultaneously becomes a challenging problem. In this paper, we consider three kinds of deployments for a sensor network on a unit square - a √n x √n grid, random uniform (for all n points), and Poisson (with density n). In all three deployments, each sensor is active with probability p, independently from the others. Then, we claim that the critical value of the function npπr2/log(np) is 1 for the event of k-coverage of every point. We also provide an upper bound on the window of this phase transition. Although the conditions for the three deployments are similar, we obtain sharper bounds for the random deployments than the grid deployment, which occurs due to the boundary condition. In this paper, we also provide corrections to previously published results for the grid deployment model. Finally, we use simulation to show the usefulness of our analysis in real deployment scenarios.
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
Bollobás, B. (1985) · Cited by 6,196
Introduction to Probability Models.
Jolliffe, F., & Ross, S. M. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983433 · Cited by 4,525
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Fine-grained network time synchronization using reference broadcasts
Elson, J., Girod, L., & Estrin, D. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844143 · Cited by 2,396
Timing-sync protocol for sensor networks
Ganeriwal, S., Kumar, R., & Srivastava, M. B. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958508 · Cited by 2,051
Understanding packet delivery performance in dense wireless sensor networks
Zhao, J., & Govindan, R. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958493 · Cited by 1,267
Integrated coverage and connectivity configuration in wireless sensor networks
Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., & Gill, C. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958496 · Cited by 1,265
Critical Power for Asymptotic Connectivity in Wireless Networks
Gupta, P., & Kumar, P. R. (1999) · Stochastic Analysis, Control, Optimization and Applications · doi:10.1007/978-1-4612-1784-8_33 · Cited by 1,137
Alon, N., & Spencer, J. H. (2000) · Wiley eBooks · doi:10.1002/0471722154 · Cited by 949
Cited by
Location-based compromise-tolerant security mechanisms for wireless sensor networks
Zhang, Y., Liu, W., Lou, W., & Fang, Y. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861382 · Cited by 329
Metadata
- Authors
- Kumar, S., Lai, T. H., & Balogh, J.
- Venue
- Proceedings of the 10th annual international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2004-09-26
- Pages
- 144-158
- ISSN
- 1543-5679 (ISSN-L)
- OpenAlex
- W2127497269
- Cited by
- 639
- References
- 19
- FWCI
- 21.41
- Type
- conference paper
- 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: On k-coverage in a mostly sleeping sensor network. https://app.cochat.ai/papers/10.1145/1023720.1023735
- The paper
- Kumar, S., Lai, T. H., & Balogh, J. (2004). On k-coverage in a mostly sleeping sensor network. Proceedings of the 10th annual international conference on Mobile computing and networking. https://doi.org/10.1145/1023720.1023735
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.