A low-complexity geometric bilateration method for localization in Wireless Sensor Networks and its comparison with...

Area of Science:

• Computer Science
• Robotics
• Signal Processing

Background:

• Accurate localization is crucial for distributed systems and robotics.
• Existing localization algorithms, like Least-Squares, can be computationally intensive.

Purpose of the Study:

• To introduce a novel distributed, formula-based bilateration algorithm for initial node localization.
• To evaluate the algorithm's accuracy and computational complexity against established methods.

Main Methods:

• The algorithm employs distance estimates from nodes to anchors.
• It solves multiple circle-circle intersection (CCI) problems using a geometric formulation.
• Clustering of CCI solutions and averaging are used to determine initial node locations.

Main Results:

• The proposed bilateration algorithm demonstrates competitive accuracy.
• Its computational performance is comparable to optimized localization algorithms.
• The geometric approach provides a robust method for initial positioning.

Conclusions:

• The distributed bilateration algorithm is an effective and efficient solution for initial node localization.
• It presents a viable alternative to Least-Squares methods, particularly in terms of computational load.