Abstract
One of the most limiting constraint for the widespread use of wireless sensor network (WSN) is the limited energy of the individual sensor node. The distributed nodes in the WSN need to communicate the information either directly or indirectly from the source to the destination. The selection of optimal path from the source to destination becomes very critical for network lifetime. To maximize the network lifetime, this paper proposes a modied version of Dijkstra's algorithm with a new evaluation metric. The evaluation metric considers the residual energy of the nodes, their distance, number of neighbors and the link reliability to minimize the energy consumption of the network. The simulation results show the proposed algorithm signicantly improves the network life, approximately 12.25% (27.73%) as compared to Dijkstra's and Floyd Warshall's algorithm, by minimizing the energy consumption by reducing the need to re-route the message due to link failure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
