scholarly journals Sequential Localization with Inaccurate Measurements

2009 ◽  
pp. 174-197 ◽  
Author(s):  
Jia Fang ◽  
Dominique Duncan ◽  
A. Stephen Morse
Keyword(s):  
Sensor Network ◽  
Experimental Evaluation ◽  
Sequential Algorithm ◽  
Localization Problem ◽  
Distance Measurements ◽  
Sensor Network Localization ◽  
Distance Information ◽  
Network Localization ◽  
Sensor Positions

The sensor network localization problem with distance information is to determine the positions of all sensors in a network given the positions of some sensors and the distances between some pairs of sensors. In this chapter the authors present a sequential algorithm for estimating sensor positions when only inaccurate distance measurements are available, and they use experimental evaluation to demonstrate network instances on which the algorithm is effective.

scholarly journals Geometric Buildup Algorithms for Sensor Network Localization

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Zhenzhen Zheng ◽  
Xinlong Luo ◽  
Zhijun Wu
Keyword(s):  
Sensor Network ◽  
Test Results ◽  
Localization Problem ◽  
Ideal Case ◽  
Sensor Network Localization ◽  
Small System ◽  
Network Localization ◽  
Distance Data

We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using the distances between the determined sensors and the undetermined ones. Each time, only a small system of distance equations needs to be solved and therefore, in an ideal case when the required distances are available for every sensor to be determined, the computation can be completed innsteps ifnsensors are to be determined. An algorithm with two buildup phases is also implemented to handle not only noisy but also sparse distance data with for example only a few distant anchors. We show our test results and compare them with other approaches.

Sign in / Sign up

Export Citation Format

Share Document