The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
On the Optimal Robot Routing Problem in Wireless Sensor Networks
Abstract
Given a set of sparsely distributed sensors in the Euclidean plane, a mobile robot is required to visit all sensors to download the data and finally return to its base. The effective range of each sensor is specified by a disk, and the robot must at least reach the boundary to start communication. The primary goal of optimization in this scenario is to minimize the traveling distance by the robot. This problem can be regarded as a special case of the traveling salesman problem with neighborhoods (TSPN), which is known to be NP-hard. In this paper, we present a novel TSPN algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.
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
Wireless sensor networks: a survey
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · Computer Networks · doi:10.1016/s1389-1286(01)00302-4 · Cited by 17,418
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
Atkinson, A., Barnett, V., & Lewis, T. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983451 · Cited by 1,682
Evolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572
Model-Driven Data Acquisition in Sensor Networks
Deshpande, A., Guestrin, C., Madden, S. R., Hellerstein, J. M., & Hong, W. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50053-x · Cited by 1,036
Detection, classification, and tracking of targets
Li, D., Wong, K. D., Hu, Y. H., & Sayeed, A. M. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985674 · Cited by 932
The Euclidean travelling salesman problem is NP-complete
Papadimitriou, C. H. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90012-3 · Cited by 776
Cited by
Accessing From the Sky: A Tutorial on UAV Communications for 5G and Beyond
Zeng, Y., Wu, Q., & Zhang, R. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2952892 · Cited by 1,589
Outlier Detection Techniques for Wireless Sensor Networks: A Survey
Zhang, Y., Meratnia, N., & Havinga, P. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.021510.00088 · Cited by 797
Applications of Wireless Sensor Networks: An Up-to-Date Survey
Kandris, D., Nakas, C., Vomvas, D., & Koulouras, G. (2020) · Applied System Innovation · doi:10.3390/asi3010014 · Cited by 732
Trajectory Design for Completion Time Minimization in UAV-Enabled Multicasting
Zeng, Y., Xu, X., & Zhang, R. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2790401 · Cited by 440
From wireless sensor networks towards cyber physical systems
Wu, F.-J., Kao, Y.-F., & Tseng, Y.-C. (2011) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2011.03.003 · Cited by 329
Spatiotemporal Data Mining: A Computational Perspective
Shekhar, S., Jiang, Z., Ali, R., Eftelioglu, E., Tang, X., Gunturi, V., & Zhou, X. (2015) · ISPRS International Journal of Geo-Information · doi:10.3390/ijgi4042306 · Cited by 206
Metadata
- Authors
- Yuan, B., Orlowska, M., & Sadiq, S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2007-09
- Volume
- 19
- Issue
- 9
- Pages
- 1252-1261
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2117257995
- Cited by
- 270
- References
- 24
- FWCI
- 19.17
- 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.