Weighted-based path rediscovery routing algorithm for improving the routing decision in wireless sensor network

Route failures pursued by rerouting is common in WSNs due to the unpredictable network dynamics and autonomous node behaviors. Optimal selection of neighbor is henceforth necessary to ensure profitable packet delivery and application support. In this manuscript, we propose a Weighted Path Rediscovery (WPR) routing for improving the routing decisions of WSN nodes. This routing algorithm is intended to prevent backtracking and curtail looped routing in WSNs. WPR precis’s conventional routing based on link expiration time (let) and fun factor at the time of neighbor discovery and reinforced routing, respectively. The two distinct features are converged using link stability factor to ensure the improved routing satisfying node’s behavior constraints. This improves the quality of packet transmission and minimizes routing complexity. The proposed routing algorithm is assessed using the factors: Packet Delivery Ratio (PDR), End-to-End Delay, Overhead and Connection Ratio.