Abstract

Aiming at the problem of large location errors of traditional ranging-free algorithms in Wireless Sensor Network (WSN), a novel node location algorithm based on proximity-distance mapping (PDM) and Jaya optimization was proposed. In this algorithm, proximity and Euclidean distance are extracted from the relationship of anchor nodes to construct a mapping matrix by using the idea of PDM. It is calculated by using the mapping matrix that the estimated distance from the unknown node to the anchor node can be used for the subsequent calculations. After the estimated distance is obtained, the Jaya optimization algorithm is imported to calculate the location of the unknown one. To accelerate the convergence and enhance the accuracy of the algorithm, the idea of a boundary box is used to limit the initial feasible region of unknown nodes. The experiment results show that the PDM–Jaya algorithm has better positioning accuracy than the original PDM in the same condition.

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