Abstract

Localization provides the key support for wireless sensor networks (WSNs). In order to solve the large-error problem in the third phase and the poor position accuracy of the least square method in the weighted DV-Hop algorithm, a hybrid algorithm of GA + simplex method was proposed in this paper. The weighted DV-Hop position algorithm was applied to estimate the distance between the unknown node and the anchor node in the first and second phase. In the third phase, a hybrid genetic algorithm with the simplex method was proposed to optimize the coordinates of the unknown nodes. In the hybrid genetic algorithm, a fitness function which combined the cost function with the penalty function was built, and the simplex method was used to increase the local search ability of the algorithm. Experiments show that both of the localization accuracy and network coverage rate are improved significantly, and the hybrid algorithm of GA + simplex method is suitable for the WSN localization.

Highlights

  • In the past decades, the advances in microelectronics, computer, and wireless communication technologies stimulate the rapid development of low-power and multifunction sensors, which can integrate the information acquisition, data processing, wireless communication, and other functions in a tiny volume

  • The positioning coverage of genetic algorithm (GA) distance vector-hop (DV-Hop) is larger than that of the weighted DV-Hop algorithm, and the hybrid algorithm of GA + simplex method performs significantly better than the GA DV-Hop

  • The genetic algorithm is suitable for correction of the weighted DV-Hop localization due to its own characteristics

Read more

Summary

Introduction

The advances in microelectronics, computer, and wireless communication technologies stimulate the rapid development of low-power and multifunction sensors, which can integrate the information acquisition, data processing, wireless communication, and other functions in a tiny volume. The wireless sensor network (WSN) is a multiple-hops and self-organizing network system which consists of a large number of low-cost microsensor nodes deployed in monitoring area and communicating through wireless. The node location is one of the most basic functions in sensor networks, and it plays a key role in various applications. The range-free localization (RFL) is obtained by estimating the distance of the two nodes. The traditional distance vector-hop (DV-Hop) algorithm was proposed by Dragos Niculescu, which uses GPS and distance vector routing It is a range-free method [3], meaning that it does not measure the distance directly but rather utilizes the information of the distance vector and network connectivity to get the estimated distance.

The DV-Hop Algorithm
The Error Analysis
The Improvement of DV-Hop Localization Algorithm
Experimental Results and Analysis
Results and Analysis
Conclusion
Conflict of Interests

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

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.