Range-Free Localization with the Radical Line
Hongyang Chen, Y.T. Chan, H. Vincent Poor, and Kaoru Sezaki

TL;DR
This paper introduces a radical line-based range-free localization method for wireless sensor networks that improves accuracy over the centroid algorithm with a modest increase in computational complexity.
Contribution
It proposes a novel radical line-based localization technique that enhances accuracy in range-free WSN localization compared to existing centroid methods.
Findings
Radical line method improves accuracy by 2-30% over centroid algorithm.
The method's effectiveness varies with anchor range similarity and DOI values.
Simulation results validate the increased precision of the proposed approach.
Abstract
Due to hardware and computational constraints, wireless sensor networks (WSNs) normally do not take measurements of time-of-arrival or time-difference-of-arrival for rangebased localization. Instead, WSNs in some applications use rangefree localization for simple but less accurate determination of sensor positions. A well-known algorithm for this purpose is the centroid algorithm. This paper presents a range-free localization technique based on the radical line of intersecting circles. This technique provides greater accuracy than the centroid algorithm, at the expense of a slight increase in computational load. Simulation results show that for the scenarios studied, the radical line method can give an approximately 2 to 30% increase in accuracy over the centroid algorithm, depending on whether or not the anchors have identical ranges, and on the value of DOI.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
