The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Coverage problems in wireless ad-hoc sensor networks
Abstract
Wireless ad-hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. We address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided by a particular sensor network. We first define the coverage problem from several points of view including deterministic, statistical, worst and best case, and present examples in each domain. By combining the computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, we establish the main highlight of the paper-optimal polynomial time worst and average case algorithm for coverage calculation. We also present comprehensive experimental results and discuss future research directions related to coverage in sensor networks.
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
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Wireless integrated network sensors
Pottie, G. J., & Kaiser, W. J. (2000) · Communications of the ACM · doi:10.1145/332833.332838 · Cited by 3,219
(1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030669 · Cited by 597
Tennenhouse, D. (2000) · Communications of the ACM · doi:10.1145/332833.332837 · Cited by 470
Embedded computation meets the World Wide Web
Borriello, G., & Want, R. (2000) · Communications of the ACM · doi:10.1145/332833.332839 · Cited by 109
Contact sensor-based coverage of rectilinear environments
Butler, Z. J., Rizzi, A. A., & Hollis, R. L. (1999) · doi:10.1109/isic.1999.796666 · Cited by 79
Cited by
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Savvides, A., Han, C.-C., & Strivastava, M. B. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381693 · Cited by 2,694
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605408 · Cited by 1,804
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
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
From RSSI to CSI: Indoor localization via channel response
Yang, Z., Zhou, Z., & Liu, Y. (2013) · ACM Computing Surveys · doi:10.1145/2543581.2543592 · Cited by 1,229
Metadata
- Authors
- Meguerdichian, S., Koushanfar, F., Potkonjak, M., & Srivastava, M. B.
- Venue
- Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- Publisher
- IEEE
- Published
- 2002-11-13
- Volume
- 3
- Pages
- 1380-1387
- OpenAlex
- W2100430744
- Cited by
- 1,694
- References
- 7
- FWCI
- 43.56
- 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
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.