Sensors, Vol. 20, Pages 343: Enhancing the Sensor Node Localization Algorithm Based on Improved DV-Hop and DE Algorithms in Wireless Sensor Networks

Sensors, Vol. 20, Pages 343: Enhancing the Sensor Node Localization Algorithm Based on Improved DV-Hop and DE Algorithms in Wireless Sensor Networks Sensors doi: 10.3390/s20020343 Authors: Dezhi Han Yunping Yu Kuan-Ching Li Rodrigo Fernandes de Mello 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 ex...
Source: Sensors - Category: Biotechnology Authors: Tags: Article Source Type: research