 
Summary: MDLT: A Polynomial Time Optimal Algorithm for
Maximization of TimetoFirstFailure in Energy
Constrained Wireless Broadcast Networks
Arindam K. Das, Robert J. Marks, Mohamed ElSharkawi, Payman Arabshahi, Andrew Gray
AbstractWe consider the problem of maximizing the time
tofirstfailure, defined as the time till the first node in the net
work runs out of battery energy, in energy constrained broad
cast wireless networks. We discuss a greedy algorithm and
prove that it solves the problem optimally for a broadcast ap
plication, in polynomial time, provided the complete power ma
trix and the battery residual capacities are known.
I. Introduction
We consider the problem of maximizing the timeto
firstfailure in energy constrained broadcast wireless net
works where each node is powered by batteries. In appli
cations where replacement/maintenance of such batteries
is difficult or infeasible, it is of utmost importance to de
sign routing protocols which maximize the lifetime of the
network. A metric commonly used to define the lifetime
of a network is the duration of time before any node in
