Published Paper Details:

The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem by maximizing the time at which the first node runs out of energy subject to the flow conservation constraints. The solutions in this problem correspond to the rates allocated to each link. In this paper, propose the use of a regularization method which can jointly maximize the network lifetime and minimize another objective (e.g., packet delay). Most of the sensor nodes are battery powered. The limited amount of energy in each node is one of the bottlenecks. One simple approach is to minimize the power consumed to deliver a packet to the destination. The typical solution is to use the shortest path with link costs equal to the energy required in each link to transmit a packet. Another approach is to maximize the lifetime of the network. There are various ways to define the lifetime of a WSN. It can be defined as the time at which the first node runs out of its energy.