DTAR: A Dynamic Threshold Adaptive Ranking-Based Energy-Efficient Routing Algorithm for WSNs

Owing to uncertainties associated with energy and maintenance of large Wireless Sensor Networks (WSN) during transmission, energy-efficient routing strategies are gaining popularity. A Dynamic Threshold Adaptive Routing Algorithm (DTAR) is proposed for determining the most appropriate node to become a Cluster Head (CH) using adaptive participation criteria. For determining the next Forwarder Node (FN), an adaptive ranking scheme depends on distance ([Formula: see text]) and Residual Energy ([Formula: see text]). However, additional parameters such as Delivery Ratio (DR), End-to-End delay ([Formula: see text] delay), and Message Success Rate (MSR) should be considered to achieve the most optimal approach to achieve energy efficiency. The proposed DTAR algorithm is validated on variable clustered networks in order to investigate the effect of opportunistic routing with increasing network size and energy resources. The proposed algorithm shows a substantial decrease in energy consumption during transmission. Energy Consumption (EC), Packet Delivery Ratio (PDR), End-to-End delay ([Formula: see text] delay), and Message Success Rate (MSR) are used to illustrate the effectiveness of the proposed algorithm for energy efficiency.