Research on range-free location algorithm for wireless sensor network based on particle swarm optimization

14Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Location technology is the key support technology of wireless sensor network (WSN). The hop number and hop distance information obtained by traditional distance vector hop (DV-Hop) location algorithm can only be acquired by solving the nonlinear equations, and the solution of the equation determines the accuracy of node location. Although the least squares method has better estimation performance, the solution results are sensitive to the average hop distance, which will lead to the large error in the solution of the equation. In order to solve the problem of location error caused by initial value sensitivity of least squares method in the coordinate calculation stage of unknown nodes and beacon nodes, a range-free location algorithm based on particle swarm optimization (PSO) is proposed in this paper. The proposed approach solves the problem of location error caused by initial value sensitivity of least squares method, obtains relatively accurate solution, and improves the accuracy of location algorithm. The experimental results show that the PSO algorithm has faster convergence speed and higher location accuracy than the non-optimization algorithm.

Cite

CITATION STYLE

APA

Xue, D. (2019). Research on range-free location algorithm for wireless sensor network based on particle swarm optimization. Eurasip Journal on Wireless Communications and Networking, 2019(1). https://doi.org/10.1186/s13638-019-1540-z

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