Robust distributed node localization with error management

13 years 3 months ago
Robust distributed node localization with error management
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper introduces a novel iterative method ILS for node localization starting with a relatively small number of anchor nodes in a large network. At each iteration, nodes are localized using a least-squares based algorithm. The computation is lightweight, fast, and any-time. To prevent error from propagating and accumulating during the iteration, the error control mechanism of the algorithm uses an error registry to select nodes that participate in the localization, based on their relative contribution to the localization accuracy. Simulation results have shown that the active selection strategy significantly mitigates the effect of error propagation. The algorithm has been tested on a network of Berkeley Mica2 motes with ultrasound TOA ranging devices. We have compared the algorithm with more global methods such as MD...
Juan Liu, Ying Zhang, Feng Zhao
Added 24 Dec 2009
Updated 24 Dec 2009
Type Conference
Year 2006
Authors Juan Liu, Ying Zhang, Feng Zhao
Comments (0)