By Topic

MDLT: a polynomial time optimal algorithm for maximization of time-to-first- failure in energy constrained wireless broadcast networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
A. K. Das ; Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA ; R. J. Marks ; M. El-Sharkawi ; P. Arabshahi
more authors

We consider the problem of maximizing the time-to-first-failure, defined as the time till the first node in the network runs out of battery energy, in energy constrained broadcast wireless networks. We discuss a greedy algorithm and prove that it solves the problem optimally for a broadcast application, in polynomial time, provided the complete power matrix and the battery residual capacities are known.

Published in:

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE  (Volume:1 )

Date of Conference:

1-5 Dec. 2003