2012
DOI: 10.3390/s120100839
|View full text |Cite
|
Sign up to set email alerts
|

A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods

Abstract: This research presents a distributed and formula-based bilateration algorithm that can be used to provide initial set of locations. In this scheme each node uses distance estimates to anchors to solve a set of circle-circle intersection (CCI) problems, solved through a purely geometric formulation. The resulting CCIs are processed to pick those that cluster together and then take the average to produce an initial node location. The algorithm is compared in terms of accuracy and computational complexity with a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
32
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 36 publications
(33 citation statements)
references
References 38 publications
0
32
0
Order By: Relevance
“…This algorithm outperforms the simple gradient descent methodology, and also it avoids dangerous operations with singular matrices as the pure Newton method does. Also other more complex algorithms were tested, such as trust region methods, but it weren't found significant differences in localization result (as confinned also in [3]). It was also decided to use the LLS to initialize the optimization, because this doesn't impair its final result but helps saving computational time (that could be useful for a possible future tracking application).…”
Section: Multilateration: Linear Least Squares (Lls) [3]; Optimizatiomentioning
confidence: 92%
See 1 more Smart Citation
“…This algorithm outperforms the simple gradient descent methodology, and also it avoids dangerous operations with singular matrices as the pure Newton method does. Also other more complex algorithms were tested, such as trust region methods, but it weren't found significant differences in localization result (as confinned also in [3]). It was also decided to use the LLS to initialize the optimization, because this doesn't impair its final result but helps saving computational time (that could be useful for a possible future tracking application).…”
Section: Multilateration: Linear Least Squares (Lls) [3]; Optimizatiomentioning
confidence: 92%
“…The error model generally adopted in literature is here used (noisefactor error model): r = rT + err = rT(1 + NF randn(n, 1) (3) where r is the set of n simulated measured distances for each true distance rT. In this model the range error err is gaussian, with zero mean and standard deviation given in percentage of the true distance, through the so called Noise Factor (NF).…”
Section: Multilateration: Linear Least Squares (Lls) [3]; Optimizatiomentioning
confidence: 99%
“…19 For the algorithm evaluation, three algorithms found in the recent state of the art were used as reference. The first algorithm against was compared with the DSCL, 21 the second algorithm was the Levenberg Marquardt, 22,23 and the third one was the SOCP 15,16 algorithm. The main characteristics evaluated were the estimation accuracy and the iterations to converge.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The algorithm is looked at as far as exactness and computational complexity with a Least-Squares localization algorithm, in light of the Levenberg-Marquardt approach. The outputs in precision versus computational execution demonstrate that the bilateration algorithm is aggressive contrasted with the optimization localization algorithms [12]. New advances in the innovation of wireless electronic devices have influenced conceivable to construct ad-hoc Wireless Sensor Networks (WSNs) utilizing cheap nodes comprising of low-power processors, an unassuming amount of money, and basic wireless transceivers.…”
Section: Introductionmentioning
confidence: 99%