A Novel Two-Class Localization Algorithm in Wireless Sensor Networks

Linqing GUI, Thierry VAL, Anne WEI

Abstract


For most of the applications in wireless sensor networks, localization is fundamental and essential. The localization systems can be categorized into two types: range-based and range-free. In this paper, we propose a new range-free localization algorithm. We define two classes of nodes, according to the number of anchors in the neighborhood. The computation complexity of related algorithms has also been analyzed. The simulation results prove that our proposed two-class algorithm has acceptable complexity, and achieves better precision than the existing ones, such as Centroid, CPE and DV-hop.

Keywords


localization; range-based; range-free; wireless sensor networks

Full Text:

PDF


DOI: http://dx.doi.org/10.5296/npa.v3i3.863

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

To make sure that you can receive messages from us, please add the 'macrothink.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.

Copyright © Macrothink Institute ISSN 1943-3581