A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods
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....
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2012-01-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1424-8220/12/1/839/ |
| _version_ | 1798041080116019200 |
|---|---|
| author | Juan Cota-Ruiz Jose-Gerardo Rosiles Ernesto Sifuentes Pablo Rivas-Perea |
| author_facet | Juan Cota-Ruiz Jose-Gerardo Rosiles Ernesto Sifuentes Pablo Rivas-Perea |
| author_sort | Juan Cota-Ruiz |
| collection | DOAJ |
| description | 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 Least-Squares localization algorithm, based on the Levenberg–Marquardt methodology. Results in accuracy vs. computational performance show that the bilateration algorithm is competitive compared with well known optimized localization algorithms. |
| first_indexed | 2024-04-11T22:17:30Z |
| format | Article |
| id | doaj.art-92fcfcaf789d45e295fe3e4d10acb66b |
| institution | Directory Open Access Journal |
| issn | 1424-8220 |
| language | English |
| last_indexed | 2024-04-11T22:17:30Z |
| publishDate | 2012-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj.art-92fcfcaf789d45e295fe3e4d10acb66b2022-12-22T04:00:21ZengMDPI AGSensors1424-82202012-01-0112183986210.3390/s120100839A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares MethodsJuan Cota-RuizJose-Gerardo RosilesErnesto SifuentesPablo Rivas-PereaThis 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 Least-Squares localization algorithm, based on the Levenberg–Marquardt methodology. Results in accuracy vs. computational performance show that the bilateration algorithm is competitive compared with well known optimized localization algorithms.http://www.mdpi.com/1424-8220/12/1/839/distributed-localizationwireless sensor networksLeast Squares (LS)optimizationbilateration |
| spellingShingle | Juan Cota-Ruiz Jose-Gerardo Rosiles Ernesto Sifuentes Pablo Rivas-Perea A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods Sensors distributed-localization wireless sensor networks Least Squares (LS) optimization bilateration |
| title | A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods |
| title_full | A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods |
| title_fullStr | A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods |
| title_full_unstemmed | A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods |
| title_short | A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods |
| title_sort | low complexity geometric bilateration method for localization in wireless sensor networks and its comparison with least squares methods |
| topic | distributed-localization wireless sensor networks Least Squares (LS) optimization bilateration |
| url | http://www.mdpi.com/1424-8220/12/1/839/ |
| work_keys_str_mv | AT juancotaruiz alowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods AT josegerardorosiles alowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods AT ernestosifuentes alowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods AT pablorivasperea alowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods AT juancotaruiz lowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods AT josegerardorosiles lowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods AT ernestosifuentes lowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods AT pablorivasperea lowcomplexitygeometricbilaterationmethodforlocalizationinwirelesssensornetworksanditscomparisonwithleastsquaresmethods |