Year-end Sale % OFF 
Abstract
Node localization is a key issue in wireless sensor networks (WSN) area, and distance vector hop (DV-Hop) algorithm is widely adopted in WSN localization. Existing DV-Hop based algorithms employ all anchor nodes to localize the unknown node. However there is a large error of the estimated distance from the unknown node to some anchor nodes, which also results in the final unknown node localization error large. To improve the localization accuracy, we propose an improved DV-Hop algorithm based on dynamic anchor node set (DANS IDV-Hop). Differently to the existing DV-Hop based algorithms which apply total anchor nodes, DANS IDV-Hop utilizes part of anchor nodes to participate in localization. Firstly, the selection of anchor nodes is abstracted into a combinatorial optimization problem. For selecting appropriate anchor nodes, a novel binary particle coding scheme and fitness function are designed. Subsequently, the binary particle swarm optimization (BPSO) algorithm is applied to construct the dynamic anchor node set (DANS), and the localization is carried out on the DANS. Finally, the continuous particle swarm optimization (PSO) algorithm is utilized to further optimize the unknown node coordinates. Simulation results show that DANS IDV-Hop has excellent localization accuracy than that of the original DV-Hop and other DV-Hop based improved algorithms.
Highlights
The Internet of things (IOT) is the fastest growing and most promising branch of information technology in recent years
A novel improved distance vector hop (DV-Hop) algorithm based on dynamic anchor node set (DANS IDV-Hop) is proposed on the basis of experiments
Node localization is a key issue for Wireless sensor networks (WSN), which is needed by many applications
Summary
The Internet of things (IOT) is the fastest growing and most promising branch of information technology in recent years. Wang: Improved DV-Hop Localization Algorithm Based on DANS for WSN information between nodes. As the original DV-Hop algorithm has relatively large error [24], [25], [33] compared to range-based localization algorithms, how to improve the DV-Hop localization accuracy has both theoretical and practical significance. If a number of anchor nodes which have smaller error of estimated distance to unknown nodes are selected to participate in localization, the accuracy may be improved. A novel improved DV-Hop algorithm based on dynamic anchor node set (DANS IDV-Hop) is proposed on the basis of experiments. The first and second steps of DANS IDV-Hop are same as that of the original DV-Hop. In the third step of DANS IDV-Hop, the binary particle swarm optimization (BPSO) algorithm is utilized to construct a dynamic anchor node set (DANS) to localize the unknown nodes.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
