Analysis of Five Typical Localization Algorithms for Wireless Sensor Networks

  • Li S
  • Ding X
  • Yang T
N/ACitations
Citations of this article
18Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Li, S., Ding, X., & Yang, T. (2015). Analysis of Five Typical Localization Algorithms for Wireless Sensor Networks. Wireless Sensor Network, 07(04), 27–33. https://doi.org/10.4236/wsn.2015.74004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free