Minimum energy maximum residual battery capacity routing in wireless ad hoc network

Abstract

In 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. © Springer-Verlag Berlin Heidelberg 2004.