Abstract

In the traditional DV-Hop location algorithm, the number of hops within the communication radius is counted as one hop. However, in the case of uneven distribution of nodes, this method will bring a large error to the calculation of hop distance. In order to solve the above problems, an improved DV-Hop location algorithm with multiple communication radius is proposed in this paper. Based on the multi-communication radius location algorithm, the method uses the cosine theorem to correct the hop number and estimated the average hop distance, and optimizes the estimated distance of the unknown node. The algorithm uses multiple communication radius to broadcast the position to obtain the minimum number of hops between the unknown node and the beacon node and adjusts the estimated hop distance by using the cosine theorem after estimating the good hop distance, and finally uses the trilateration method, or the maximum likelihood estimation method estimates the position coordinates. The experimental results show that compared with the traditional DV-Hop algorithm and DDV-Hop algorithm, the improved DV-Hop algorithm improves the positioning accuracy and reduces the average positioning error of the unknown nodes.

Highlights

  • Wireless Sensor Network (WSN) has the advantages of rapid deployment, good concealment, strong self-organization, and low price, so it is very suitable for target tracking, recognition, positioning, and other applications [1,2,3,4]

  • (2) This paper presents an improved DV-Hop location algorithm based on multiple communication radius, which uses the cosine theorem to correct the hop number and estimated average hop distance, and optimizes the estimated distance of the unknown node

  • In order to reduce the error of estimated distance between nodes and improve the accuracy of location algorithm, this paper presents an improved DV-Hop location algorithm based on multiple communication radius

Read more

Summary

Introduction

Wireless Sensor Network (WSN) has the advantages of rapid deployment, good concealment, strong self-organization, and low price, so it is very suitable for target tracking, recognition, positioning, and other applications [1,2,3,4]. (2) This paper presents an improved DV-Hop location algorithm based on multiple communication radius, which uses the cosine theorem to correct the hop number and estimated average hop distance, and optimizes the estimated distance of the unknown node. In order to reduce the error of estimated distance between nodes and improve the accuracy of location algorithm, this paper presents an improved DV-Hop location algorithm based on multiple communication radius. Based on the multi-communication radius location algorithm, the method uses the cosine theorem to correct the hop number and estimated average hop distance, and optimizes the estimated distance of the unknown node. The algorithm uses multiple communication radius to broadcast the position to obtain the minimum number of hops between the unknown node and the beacon node, and adjusts the estimated hop distance by using the cosine theorem after estimating the good hop distance, and uses the trilateration method or the maximum likelihood estimation method estimates the position coordinates

The limitation of DV-Hop location algorithm
Correct average hops distance Note
Experimental results and analysis
Conclusion
Full Text
Published version (Free)

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