The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes
Open accessAbstract
The paper introduces DILOC, a distributed, iterative algorithm to locate M sensors (with unknown locations) in Rm, m ges 1, with respect to a minimal number of m + 1 anchors with known locations. The sensors and anchors, nodes in the network, exchange data with their neighbors only; no centralized data processing or communication occurs, nor is there a centralized fusion center to compute the sensors' locations. DILOC uses the barycentric coordinates of a node with respect to its neighbors; these coordinates are computed using the Cayley-Menger determinants, i.e., the determinants of matrices of internode distances. We show convergence of DILOC by associating with it an absorbing Markov chain whose absorbing states are the states of the anchors. We introduce a stochastic approximation version extending DILOC to random environments, i.e., when the communications among nodes is noisy, the communication links among neighbors may fail at random times, and the internodes distances are subject to errors. We show a.s. convergence of the modified DILOC and characterize the error between the true values of the sensors' locations and their final estimates given by DILOC. Numerical studies illustrate DILOC under a variety of deterministic and random operating conditions.
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
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Thrun, S. (2002) · Communications of the ACM · doi:10.1145/504729.504754 · Cited by 7,994
Nonnegative Matrices in the Mathematical Sciences
(1979) · Elsevier eBooks · doi:10.1016/c2013-0-10361-3 · Cited by 5,451
Nonnegative Matrices in the Mathematical Sciences
Berman, A., & Plemmons, R. J. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971262 · Cited by 3,573
Locating the nodes: cooperative localization in wireless sensor networks
Patwari, N., Ash, J. N., Kyperountas, S., Hero, A. O., Moses, R. L., & Correal, N. S. (2005) · IEEE Signal Processing Magazine · doi:10.1109/msp.2005.1458287 · Cited by 3,031
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
Relative location estimation in wireless sensor networks
Patwari, N., Hero, A. O., Perkins, M., Correal, N. S., & O'Dea, R. J. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814469 · Cited by 1,879
Ad hoc positioning system (APS)
Niculescu, D., & Nath, B. (2002) · GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270) · doi:10.1109/glocom.2001.965964 · Cited by 1,801
Introduction to Probability: The Binomial And Normal Probability Distributions
(2003) · Pharmaceutical Statistics · doi:10.1201/9780203912799.ch3 · Cited by 1,208
Localization for mobile sensor networks
Hu, L., & Evans, D. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023726 · Cited by 1,050
Cited by
Gossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M. G., & Scaglione, A. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2052531 · Cited by 741
Self-citationGossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M., & Scaglione, A. (2018) · doi:10.1184/r1/6468842.v1 · Cited by 692
Self-citationNetwork localization and navigation via cooperation
Win, M., Conti, A., Mazuelas, S., Shen, Y., Gifford, W., Dardari, D., & Chiani, M. (2011) · IEEE Communications Magazine · doi:10.1109/mcom.2011.5762798 · Cited by 560
Message Passing Algorithms for Scalable Multitarget Tracking
Meyer, F., Kropfreiter, T., Williams, J. L., Lau, R., Hlawatsch, F., Braca, P., & Win, M. Z. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2789427 · Cited by 355
A Theoretical Foundation of Network Localization and Navigation
Win, M. Z., Shen, Y., & Dai, W. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2844553 · Cited by 353
Bias Reduction for an Explicit Solution of Source Localization Using TDOA
Ho, K. C. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2187283 · Cited by 348
A Survey of Localization in Wireless Sensor Network
Cheng, L., Wu, C., Zhang, Y., Wu, H., Li, M., & Maple, C. (2012) · International Journal of Distributed Sensor Networks · doi:10.1155/2012/962523 · Cited by 261
On frame and orientation localization for relative sensing networks
Piovan, G., Shames, I., Fidan, B., Bullo, F., & Anderson, B. D. O. (2013) · Automatica · doi:10.1016/j.automatica.2012.09.014 · Cited by 105
Metadata
- Authors
- Khan, U. A., Kar, S., & Moura, J. M. F.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-05
- Volume
- 57
- Issue
- 5
- Pages
- 2000-2016
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2150843948
- Cited by
- 351
- References
- 33
- FWCI
- 19.54
- Type
- journal article
- Language
- en
- Open access
- green
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.