الفهرس | Only 14 pages are availabe for public view |
Abstract The limited rechargeable battery energy characterizing the Mobile Ad-hoc Networks MANETs mobile nodes has been one of the critical resources that should be considered while designing a MANET routing protocol. Therefore, most of the recent research efforts in MANETs routing algorithms have considered energy consumption efficiency while searching and using a proper route between a certain source and a specified destination nodes. The main problem to be solved by the routing algorithm is the Multi-Constraint Path problem. The path computation algorithm is at the core of the routing strategy. Instead of choosing a shortest path algorithm based on statically configured metrics, we need an algorithm that selects several alternative paths that satisfy a set of constraints regarding energy efficiency requirements but could result in high computational complexity |