Abstract
According to that node localization accuracy is not high in the DV Hop localization algorithm, shuffled frog leaping algorithm with many advantages such as the convergence speed is fast, easy to realize and excellent performance of global optimization and so on is introduced into the design of DV-Hop algorithm. A new DV-Hop algorithm based on shuffled frog leaping algorithm (Shuffled Frog Leaping DV-Hop Algorithm, SF LA DV-Hop) is proposed in this paper. Based on traditional DV-Hop algorithm, the new algorithm used distance of nodes and position information of anchor nodes to establish objective optimization function and realize the estimation of unknown node coordinate in the final stage of DV-Hop algorithm. The simulation results showed that compared with the traditional DV-Hop algorithm, based on not increasing the sensor node hardware overhead, the improved algorithm can effectively reduce the positioning error.
Highlights
Node location information plays an important role in wireless sensor network (Wireless Sensor Network, WSN), such as detection target and tracking target, automatic configuring network topology [1]
Li Wenwen used differential evolution algorithm to calculate the location of the unknown node in the localization phase DV-HOP algorithm [5].Lin Jinzhao used the expansion of Taylor series to estimate the location of the unknown node [6].Wang Ying used average network connectivity to improve the hop distance between nodes [7]
The results show that the performance of the improved algorithm is much better than the original one
Summary
Node location information plays an important role in wireless sensor network (Wireless Sensor Network, WSN), such as detection target and tracking target, automatic configuring network topology [1]. According to the location whether there is any need for ranging, current localization algorithms are divided into range based and range free two categories [2]. The former has the characteristics of high requirements of the sensor node hardware, but the positioning accuracy is high. Li Wenwen used differential evolution algorithm to calculate the location of the unknown node in the localization phase DV-HOP algorithm [5].Lin Jinzhao used the expansion of Taylor series to estimate the location of the unknown node [6].Wang Ying used average network connectivity to improve the hop distance between nodes [7]. The results show that the performance of the improved algorithm is much better than the original one
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
