Analysis of Five Typical Localization Algorithms for Wireless Sensor Networks

HTML  XML Download Download as PDF (Size: 381KB)  PP. 27-33  
DOI: 10.4236/wsn.2015.74004    9,029 Downloads   11,629 Views  Citations

ABSTRACT

In this paper, the self-localization problem is studied. It is one of the key technologies in wireless sensor networks (WSNs). And five localization algorithms: Centroid algorithm, Amorphous algorithm, DV-hop algorithm, APIT algorithm and Bounding Box algorithm are discussed. Simulation of those five localization algorithms is done by MATLAB. The simulation results show that the positioning error of Amorphous algorithm is the minimum. Considering economy and localization accuracy, the Amorphous algorithm can achieve the best localization performance under certain conditions.

Share and Cite:

Li, S. , Ding, X. and Yang, T. (2015) Analysis of Five Typical Localization Algorithms for Wireless Sensor Networks. Wireless Sensor Network, 7, 27-33. doi: 10.4236/wsn.2015.74004.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.