Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Autocalibration Algorithm for Ultrasonic Location Systems
ISWC '03 Proceedings of the 7th IEEE International Symposium on Wearable Computers
LaMSM: localization algorithm with merging segmented maps for underwater sensor networks
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
| Hi-index | 0.00 |
This paper studies the problem of determining the position of beacon nodes in Local Positioning Systems (LPSs), for which there are no inter-beacon distance measurements available and neither the mobile node nor any of the stationary nodes have positioning or odometry information. The common solution is implemented using a mobile node capable of measuring its distance to the stationary beacon nodes within a sensing radius. Many authors have implemented heuristic methods based on optimization algorithms to solve the problem. However, such methods require a good initial estimation of the node positions in order to find the correct solution. In this paper we present a new method to calculate the inter-beacon distances, and hence the beacons positions, based in the linearization of the trilateration equations into a closed-form solution which does not require any approximate initial estimation. The simulations and field evaluations show a good estimation of the beacon node positions.