Next Article in Journal
Real Time Corner Detection for Miniaturized Electro-Optical Sensors Onboard Small Unmanned Aerial Systems
Next Article in Special Issue
Brain Computer Interfaces, a Review
Previous Article in Journal
Reliability and Availability Evaluation of Wireless Sensor Networks for Industrial Applications
Previous Article in Special Issue
Fusion of a Variable Baseline System and a Range Finder
Article Menu

Export Article

Open AccessArticle
Sensors 2012, 12(1), 839-862; doi:10.3390/s120100839

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

1
Department of Electrical and Computer Engineering, Autonomous University of Ciudad Juárez (UACJ), Ave. del Charro # 450 Nte. C.P.32310, Ciudad Juárez, Chihuahua, México
2
Rosiles Consulting, El Paso, TX 79938, USA
3
Department of Computer Science, Baylor University, One Bear Place #97356, Waco, TX 76798, USA
*
Author to whom correspondence should be addressed.
Received: 12 December 2011 / Revised: 9 January 2012 / Accepted: 10 January 2012 / Published: 12 January 2012
(This article belongs to the Special Issue Collaborative Sensors)
View Full-Text   |   Download PDF [2334 KB, uploaded 21 June 2014]   |  

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 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. View Full-Text
Keywords: distributed-localization; wireless sensor networks; Least Squares (LS); optimization; bilateration distributed-localization; wireless sensor networks; Least Squares (LS); optimization; bilateration
Figures

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Cota-Ruiz, J.; Rosiles, J.-G.; Sifuentes, E.; Rivas-Perea, P. A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods. Sensors 2012, 12, 839-862.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top