A Robust Routing Algorithm with Dynamic Minimum Hop Selection in Wireless Sensor Networks with Unreliable Links

Abstract

The efficient routing poses to be one of the main issues encountered in wireless sensor networks, and, in recent years, there has been carried out extensive investigation of the optimization method of energy and latency. Nonetheless, little work has already been done under austere conditions, for instance, chemical plants, oil fields, nuclear power plant, and the battlefield with unreliable links. So, it appears to be a new challenging point of concern that how to ensure the stability as well as reliability of data transmission under the high risk environment. In this research work, we have introduced a robust routing protocol, a novel design algorithm with dynamic minimum hop selection (DMHS) by dynamic programming. The major idea is making the probabilistic forwarding decisions for the utilization of a distributed routing discovery strategy with the node’s minimum hop dynamic adjustment. Simulation experiments revealed that, in comparison with conventional energy efficiency algorithm, the DMHS algorithm offers approximately 15% increases of lifetime more than 700 nodes, in addition to having better performance on average delivery rate at the nodes death rate from 20% to 60%.