A Recursive Shortest Path Routing Algorithm With Application for Wireless Sensor Network Localization

In this paper, we present a routing algorithm useful in the realm of centralized range-based localization schemes. The proposed method is capable of estimating the distance between two non-neighboring sensors in multi-hop wireless sensor networks. Our method employs a global table search of sensor edges and recursive functions to find all possible paths between a source sensor and a destination sensor with the minimum number of hops. Using a distance matrix, the algorithm evaluates and averages all paths to estimate a measure of distance between both sensors. Our algorithm is then analyzed and compared with classical and novel approaches, and the results indicate that the proposed approach outperforms the other methods in distance estimate accuracy when used in random and uniform placement of nodes for large-scale wireless networks. Furthermore, the proposed methodology is suitable for the implementation in centralized localization schemes, such as multi-dimensional scaling, least squares, and maximum likelihood to mention a few.