Abstract

This paper presents an Energy Saving-oriented Routing Algorithm Based on Dijkstra (ESRAD) in Wireless Sensor Networks (WSN). The ESRAD is designed to be economic to energy consumption in information transmission between any of two sensor nodes in a WSN. By modeling energy consumption of nodes in a WSN as evaluation index of hop count judgment in least-hop routing algorithm, this study first presents an improved Energy Saving-oriented Least-hop Routing Algorithm (ESLHA) to search the shortest path of energy consumption with least nodes between origin node and object node. Then, in the light that the ESLHA does not take the energy consumption in transmission process into account, the ESRAD models the evaluation index of energy consumption at each node, which is the weight of each edge in a WSN, by introducing energy consumption at both node and transmission process, and employs a Dijkstra-based routing algorithm to efficiently search the reliable shortest path with least energy consumption. The performance of the ESRAD is compared to those of the ESLHA and the Dijkstra for different WSNs. Extensive simulation tests on randomly simulated WSNs have demonstrated the potential of the proposed ESRAD for searching the shortest path with least energy consumption to transmit information between any of two nodes in WSNs.

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 call

Disclaimer: 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.