Abstract
The optimal energy saving routing algorithm proposed in this paper is based on the shortest path tree. This algorithm introduces the concept of node classification and builds the weight function based on link energy consumption factor, neighbor node’s residual energy factor and type weight and so on. It uses different weight factor according to different types of nodes, and finally generates the shortest path tree, all nodes send data to sink node along the shortest path tree. The simulation results show that the algorithm can prolong the network life time, balance energy consumption of each node, and reduce the average network delay.
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.
