Cargando…
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....
Autores principales: | Cota-Ruiz, Juan, Rosiles, Jose-Gerardo, Sifuentes, Ernesto, Rivas-Perea, Pablo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Molecular Diversity Preservation International (MDPI)
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279242/ https://www.ncbi.nlm.nih.gov/pubmed/22368498 http://dx.doi.org/10.3390/s120100839 |
Ejemplares similares
-
Robust Least-SquareLocalization Based on Relative Angular Matrix in Wireless Sensor Networks
por: Tian, Yuyang, et al.
Publicado: (2019) -
Hybrid RSS/AOA Localization using Approximated Weighted Least Square in Wireless Sensor Networks
por: Kang, SeYoung, et al.
Publicado: (2020) -
Numerical methods for least squares problems /
por: Björck, {ring}Ake, 1934-
Publicado: (1996) -
System identification: least-squares methods
por: Hsia, Tien C
Publicado: (1977) -
Numerical methods for least squares problems
por: Bjorck, Ake
Publicado: (1996)