Dynamic Routing For Uniform Energy Distribution in Wireless Sensor Network Using a Modified Dijkstra Algorithm

The Wireless-sensor-networks are the foundation of the Internet-of-Things, playing an important role in various applications such as ecosystem monitoring, health care, smart city, industrial automation and smart agriculture. In these networks, shortest-path-algorithms are crucial for optimizing data transmission, ensuring faster communication while minimizing energy consumption. This paper introduces a modification to the traditional Dijkstra algorithm by incorporating a cost function that accounts for both node energy levels and path length, balanced by a weighting factor. The proposed algorithm aims to distribute energy consumption more uniformly across the network, thereby extending its overall lifetime and enhancing the network's efficiency. For simulation purposes, the algorithm code was developed using the C programming language in Visual Studio Code. This approach offers a potential solution for optimizing routing and managing energy in wireless-sensor-networks.