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

被引：31

作者：

Cota-Ruiz, Juan ^{[1
]}

Rosiles, Jose-Gerardo ^{[2
]}

Sifuentes, Ernesto ^{[1
]}

Rivas-Perea, Pablo ^{[3
]}

机构：

[1] Autonomous Univ Ciudad Juarez UACJ, Dept Elect & Comp Engn, Ciudad Juarez 32310, Chihuahua, Mexico

[2] Rosiles Consulting, El Paso, TX 79938 USA

[3] Baylor Univ, Dept Comp Sci, Waco, TX 76798 USA

来源：

SENSORS | 2012年 / 12卷 / 01期

关键词：

distributed-localization; wireless sensor networks; Least Squares (LS); optimization; bilateration; NODE LOCALIZATION; ALGORITHM;

D O I：

10.3390/s120100839

中图分类号：

O65 [分析化学];

学科分类号：

070302 ; 081704 ;

摘要：

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.

引用

页码：839 / 862

页数：24

共 47 条

[1] A survey on sensor networks [J].