Abstract
AbstractIn this paper we consider the problem of routing in a wireless ad-hoc network from the viewpoint of energy efficiency. Each node in a wireless ad-hoc network runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in such networks. To maximize the lifetime of nodes in a network, the energy consumption rate of each node must be evenly distributed. In addition, the overall transmission power for each connection request should be minimized. We refer to the problem that addresses these two objectives concurrently as the Minimum Energy Maximum Residual Battery Capacity Routing Problem (MEMRBCRP). In this paper, we propose an algorithm for MEMRBCRP and prove that the problem is optimally solvable in polynomial time using the proposed algorithm.Keywordsenergy-aware routingwireless ad-hoc networkslimited energy resourcemaximizing network lifetime
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.
