Dil, B.J. and Dulman, S.O. and Havinga, P.J.M.
Range-Based Localization in Mobile Sensor Networks.
In: Proceedings of Third European Workshop on Wireless Sensor Networks, 13-15 Feb 2006, Zurich, Switzerland.
Lecture notes in computer science 3868.
Full text available as:
PDF - Univ. of Twente only
Official URL: http://dx.doi.org/10.1007/11669463_14
Localization schemes for wireless sensor networks can be
classified as range-based or range-free. They differ in the information used for localization. Range-based methods use range measurements, while range-free techniques only use the content of the messages. None of the existing algorithms evaluate both types of information. Most of the
localization schemes do not consider mobility. In this paper, a Sequential Monte Carlo Localization Method is introduced that uses both types of information as well as mobility to obtain accurate position estimations, even when high range measurement errors are present in the network and
unpredictable movements of the nodes occur. We test our algorithm in various environmental settings and compare it to other known localization algorithms. The simulations show that our algorithm outperforms these known range-oriented and range-free algorithms for both static and
dynamic networks. Localization improvements range from 12% to 49% in a wide range of conditions.
|Item Type:||Conference or Workshop Paper (Full Paper, Talk)|
|Research Group:||EWI-CAES: Computer Architecture for Embedded Systems|
|Research Program:||CTIT-UBRICKS: Building Blocks for Ubiquitous Computing and Communication|
|Research Project:||Featherlight Distributed Systems: A platform for the next generation of ambient systems|
|Deposited On:||18 January 2007|
Export this item as:
To request a copy of the PDF please email us request copy
To correct this item please ask your editor
Repository Staff Only: edit this item