Year-end Sale % OFF 
Abstract
Wireless sensor networks are more and more important for various applications. Localization plays an important role in WSN. In this article, Aiming at the large errors that the DV—Hop localization algorithm have in net topology with randomly-distributed nodes, this paper proposed a CLDV-Hop algorithm in DV-Hop based on modifying average hopping distances. Firstly, hop count threshold is set to optimize the anchor node when data exchange. Then, according to the minimum mean square criteria and unknown nodes nearest three anchor nodes weighted average hop distance are selected as its average hop distance. Finally, L-M algorithm is used to optimize the coordinate of unknown node estimated by least squares. The simulation results show that, without increasing the overhead and the same conditions as the simulation environment, CLDV-Hop algorithm has higher positioning accuracy than existing improved algorithms, and compared with DV-Hop algorithm accuracy is improved by about 33% - 41%.
Highlights
Wireless Sensor Network (WSN) consists of a large number of sensor nodes distributed in the area with perceptive, processing and transmitting environment information
The positioning accuracy of DV-Hop algorithm in WSN mainly depends on hop count, average hop distance and position calculation
This paper proposes iterative algorithm for L-M in WSN, based on modifying average hopping distances
Summary
Wireless Sensor Network (WSN) consists of a large number of sensor nodes distributed in the area with perceptive, processing and transmitting environment information. Various positioning algorithms, which can be divided into range-based localization algorithms (Range-Based) and range-free localization algorithm (Range-Free) [4] The former requires measuring absolute distance and angle between neighboring nodes. Range-Based has a higher requirement to hardware and it needs repeated measurements to obtain reasonable positioning accuracy. It will cost a large amount of computation and communication. DV-Hop is a typical Range-Free localization algorithm with simple implementation and high positioning accuracy. The results show that the proposed algorithm has higher positioning accuracy and stability in the network topology in randomlydistributed nodes. The application environment and conclusion of CLDV-Hop algorithm are given according to simulation experiment
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 callMore From: International Journal of Online and Biomedical Engineering (iJOE)
Disclaimer: 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.
