Power Conservation in Ad-Hoc Networks Using Dijkstra's Algorithm & Idle Nodes
The energy conservation in a wireless ad-hoc network is of great importance and significance. The nodes in a wireless environment are subject to less transmission capabilities and limited battery resources. The battery of node is energy limited and is not convenient to be replaced by the restriction of circumstance. But, the authors have to ensure that even the slightest of energy is utilized and the overall power conserved in a wireless environment is greatly reduced. This paper aims at reducing the power conservation in a wireless ad-hoc network using Dijkstra's algorithm and a set of available idle nodes.