Energy-Aware Adaptive Dijkstra: A Robust Routing Algorithm for Wireless Sensor Networks in Dynamic Environments

In the realm of Wireless Sensor Networks (WSN s), the quest for efficient routing algorithms that optimize energy consumption and adapt to dynamic network conditions is paramount. This paper introduces a novel routing algorithm, Energy-Aware Adaptive Dijkstra (EAAD), designed to address these challenges. EAAD leverages the principles of Dijkstra's algorithm while incorporating energy-awareness and adaptability to mobility. The algorithm computes energy-efficient paths from source nodes to sinks, taking into account the node's energy levels and the distance involved. Moreover, EAAD accommodates mobility-induced changes by dynamically recalculating routes. In a simulation-based evaluation, EAAD demonstrated superior performance in terms of energy conservation and adaptability, resulting in a higher number of alive nodes and enhanced throughput. EAAD offers a promising solution for optimizing routing in WSN s, contributing to prolonged network lifetime and robustness in dynamic environments. Its potential extends to diverse applications where energy-efficient routing is vital.