18-03-2010, 08:38 AM
Abstract
A fundamental problem in wireless sensor networks is to maximize network lifetime under given energy constraints. In this paper, we study the network lifetime problem by considering not only maximizing the time until the first node fails, but also maximizing the lifetimes for all the nodes in the network, which we define as the Lexicographic Max-Min (LMM) node lifetime problem. The main contributions of this paper are two-fold. First, we develop a polynomial-time algorithm to derive the LMM-optimal node lifetime vector, which effectively circumvents the computational complexity problem associated with an existing state-of-the-art approach, which is exponential. The main ideas in our approach include: (1) a link-based problem formulation, which significantly reduces the problem size in comparison with a flow-based formulation, and (2) an intelligent exploitation of parametric analysis technique, which in most cases determines the minimum set of nodes that use up their energy at each stage using very simple computations. Second, we present a simple (also polynomial-time) algorithm to calculate the flow routing schedule such that the LMM-optimal node lifetime vector can be achieved. Our results in this paper advance the state-of-the-art algorithmic design for network-wide node lifetime problem and facilitate future studies of the network lifetime problem in energy-constrained wireless sensor networks
Presented BY:
Y. Thomas Hou1 , Yi Shi1 and Hanif D. Sherali2
read full report
http://springerlinkcontent/f63m3131517736jv/
