Abstract
Energy efficient routing has been well investigated with the goal of maximizing the network lifetime, which is usually defined as the time the first node dies. Once a node is dead, data transmissions in the network are assumed to fail. In this paper, we present a novel application-specific energy-efficient routing algorithm to maximize the lifetime of application flows in wireless sensor networks. We consider the network remains alive as long as the energy can maintain the flows of the application traffic even if some nodes run out of battery. First, we formulate the routing problem as a linear programming problem, which can be converted to a max-min fairness problem. Second, the lifetime of a path is evaluated by analyzing link metrics including residual energy, transmission rate, and link distance. Third, a heuristic routing algorithm is proposed to compute the best route which minimizes the cost of application flows. Simulation results have shown that our routing algorithm can prolong the flows lifetime around 10%.
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.
