The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Coverage in wireless ad hoc sensor networks
Abstract
Sensor networks pose a number of challenging conceptual and optimization problems such as location, deployment, and tracking. One of the fundamental problems in sensor networks is the calculation of the coverage. In Meguerdichian et al. (2001), it is assumed that the sensor has uniform sensing ability. We provide efficient distributed algorithms to optimally solve the best-coverage problem raised in the above-mentioned article. In addition, we consider a more general sensing model: the sensing ability diminishes as the distance increases. As energy conservation is a major concern in wireless (or sensor) networks, we also consider how to find an optimum best-coverage-path with the least energy consumption and how to find an optimum best-coverage-path that travels a small distance. In addition, we justify the correctness of the method proposed above that uses the Delaunay triangulation to solve the best coverage problem and show that the search space of the best coverage problem can be confined to the relative neighborhood graph, which can be constructed locally.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
Coverage problems in wireless ad-hoc sensor networks
Meguerdichian, S., Koushanfar, F., Potkonjak, M., & Srivastava, M. B. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916633 · Cited by 1,694
Algorithms in Combinatorial Geometry
Edelsbrunner, H. (1987) · Springer eBooks · doi:10.1007/978-3-642-61568-9 · Cited by 1,534
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
The relative neighbourhood graph of a finite planar set
Toussaint, G. T. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90066-7 · Cited by 1,008
A New Statistical Approach to Geographic Variation Analysis
Gabriel, K. R., & Sokal, R. R. (1969) · Systematic Zoology · doi:10.2307/2412323 · Cited by 854
GPS-free positioning in mobile ad-hoc networks
Capkun, S., Hamdi, M., & Hubaux, J.-P. (2005) · Proceedings of the 34th Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2001.927202 · Cited by 841
Relative neighborhood graphs and their relatives
Jaromczyk, J. W., & Toussaint, G. T. (1992) · Proceedings of the IEEE · doi:10.1109/5.163414 · Cited by 664
Voronoi Diagrams and Delaunay Triangulations
Fortune, S. (2004) · Discrete mathematics and its applications · doi:10.1201/9781420035315.ch23 · Cited by 399
Matula, D. W., & Sokal, R. R. (1980) · Geographical Analysis · doi:10.1111/j.1538-4632.1980.tb00031.x · Cited by 366
Classes of graphs which approximate the complete euclidean graph
Keil, J. M., & Gutwin, C. A. (1992) · Discrete & Computational Geometry · doi:10.1007/bf02187821 · Cited by 354
Critical power for asymptotic connectivity
Gupta, P., & Kumar, P. R. (1998) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1998.760846 · Cited by 321
Sequencing-by-hybridization revisited: the analog-spectrum proposal
Preparata, F. P. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.12 · Cited by 320
The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
Supowit, K. J. (1983) · Journal of the ACM · doi:10.1145/2402.322386 · Cited by 161
Participation incentive mechanisms in peer-to-peer subscription systems
Lui, S. M., Lang, K. R., & Kwok, S. H. (2003) · Hawaii International Conference on System Sciences (HICSS) · doi:10.1109/hicss.2002.994529 · Cited by 50
Cited by
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
Coverage and connectivity issues in wireless sensor networks: A survey
Ghosh, A., & Das, S. K. (2008) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2008.02.001 · Cited by 530
Coverage in sensor networks via persistent homology
de Silva, V., & Ghrist, R. (2007) · Algebraic & Geometric Topology · doi:10.2140/agt.2007.7.339 · Cited by 422
Location, Localization, and Localizability
Liu, Y., Yang, Z., Wang, X., & Jian, L. (2010) · Journal of Computer Science and Technology · doi:10.1007/s11390-010-9324-2 · Cited by 304
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
- Li, X.-Y., Wan, P.-J., & Frieder, O.
- Venue
- IEEE Transactions on Computers
- Published
- 2003-06
- Volume
- 52
- Issue
- 6
- Pages
- 753-763
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2144668683
- Cited by
- 521
- References
- 18
- FWCI
- 42.77
- 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
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.