Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 237

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks

Yun Wang, Xiaodong Wang, Demin Wang, Agrawal, D.P. · 2009 · IEEE Transactions on Parallel and Distributed Systems

Abstract

Localization algorithm continues to be an important and challenging topic in today's wireless sensor networks (WSNs). In this paper, a novel range-free localization algorithm using expected hop progress (LAEP) to predict the location of any sensor in a WSN is proposed. This algorithm is based on an accurate analysis of hop progress in a WSN with randomly deployed sensors and arbitrary node density. By deriving the expected hop progress from a network model for WSNs in terms of network parameters, the distance between any pair of sensors can be accurately computed. Since the distance estimation is a key issue in localization systems for WSNs, the proposed range-free LAEP achieves better performance and less communication overhead as compared to some existent schemes like DV-Hop and RAW. In addition, we study the effect of anchor placement on the algorithm performance by deriving the corresponding mean position error range. Extensive simulations are performed and the results are observed to be in good agreement with the theoretical analysis.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpds.2008.239

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 237

Metadata

Authors
Wang, Y., Wang, X., Wang, D., & Agrawal, D. P.
Venue
IEEE Transactions on Parallel and Distributed Systems
Published
2009-10
Volume
20
Issue
10
Pages
1540-1552
ISSN
1045-9219 (ISSN-L)
OpenAlex
W2170207829
Cited by
237
References
1
FWCI
7.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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks. https://app.cochat.ai/papers/10.1109/tpds.2008.239
The paper
Wang, Y., Wang, X., Wang, D., & Agrawal, D. P. (2009). Range-Free Localization Using Expected Hop Progress in Wireless Sensor Networks. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2008.239

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.