A Research on Circular Localization Algorithm of Wireless Sensor Network

2011 ◽  
Vol 58-60 ◽  
pp. 1657-1663
Author(s):  
Xin Jiang Xia ◽  
Gang Hu ◽  
Qin Wei Wei
Keyword(s):  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Wireless Sensor Node ◽  
Node Localization ◽  
Minimum Area ◽  
Anchor Node ◽  
Localization Algorithms ◽  
Low Energy Consumption ◽  
Improved Algorithm

This paper based on several common wireless sensor node localization algorithms. According to the concentric localization algorithm principle, we proposed an annular localization algorithm and its improved algorithm .The algorithm uses the anchor node to do node ring through certain rules, narrows unknown nodes estimate area continually, and until finally gets the minimum area contains unknown nodes. Then taking the minimum area centroid position as unknown node’s estimate coordinates. Through the simulation of concentric localization algorithm and its improved algorithm, circular localization algorithm and its improved algorithm, can conclude that: When the proportion of anchor node increases from 5% to 10%, the positioning accuracy is obviously improved in the situation of low energy consumption.

scholarly journals Enhancing the Sensor Node Localization Algorithm Based on Improved DV-Hop and DE Algorithms in Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (2) ◽  
pp. 343 ◽  
Author(s):  
Dezhi Han ◽  
Yunping Yu ◽  
Kuan-Ching Li ◽  
Rodrigo Fernandes de Mello
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Node Localization ◽  
Random Mutation ◽  
Localization Accuracy ◽  
De Algorithm ◽  
Distance Vector

The Distance Vector-Hop (DV-Hop) algorithm is the most well-known range-free localization algorithm based on the distance vector routing protocol in wireless sensor networks; however, it is widely known that its localization accuracy is limited. In this paper, DEIDV-Hop is proposed, an enhanced wireless sensor node localization algorithm based on the differential evolution (DE) and improved DV-Hop algorithms, which improves the problem of potential error about average distance per hop. Introduced into the random individuals of mutation operation that increase the diversity of the population, random mutation is infused to enhance the search stagnation and premature convergence of the DE algorithm. On the basis of the generated individual, the social learning part of the Particle Swarm (PSO) algorithm is embedded into the crossover operation that accelerates the convergence speed as well as improves the optimization result of the algorithm. The improved DE algorithm is applied to obtain the global optimal solution corresponding to the estimated location of the unknown node. Among the four different network environments, the simulation results show that the proposed algorithm has smaller localization errors and more excellent stability than previous ones. Still, it is promising for application scenarios with higher localization accuracy and stability requirements.

Wireless Sensor Network Node Localization Algorithm Based on PSO-MA

2021 ◽  
Author(s):  
Wenli Liu ◽  
Cuiping Shi ◽  
Hengjun Zhu ◽  
Hongbo Yu
Keyword(s):  
Large Error ◽  
Population Diversity ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Wireless Sensor Node ◽  
Node Localization ◽  
Node Density ◽  
Node Ratio ◽  
Node Location

Aiming at the large error and low accuracy of wireless sensor node location, this paper proposes a node location method based on the fusion of Particle Swarm Optimization and Monkey Algorithm (PSO-MA). Firstly, this article describes the node location model based on DV-HOP algorithm; secondly, this article uses PSO in node location, uses place Laplace distribution for population initialization, improves population diversity, and optimizes particle weights to avoid algorithm falling into local optimality. In this paper, dynamic guidance factors are used to update individual positions to improve individual optimization capabilities, and Monkey Algorithm is used to select individuals to improve the quality of optimal solutions. In the simulation experiment, the algorithm PSO and MA of this paper are compared to achieve better positioning results in the reference node ratio, node density and communication radius indicators.

Sign in / Sign up

Export Citation Format

Share Document