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

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 applicat...

Full description

Saved in:
Bibliographic Details
Main Authors: Das, A.K., Marks, R.J., El-Sharkawi, M., Arabshahi, P., Gray, A.
Format: Conference Proceeding
Language:English
Subjects:
Batteries
Broadcasting
Greedy algorithms
Intelligent networks
Polynomials
Receiving antennas
Symmetric matrices
Transmitters
Transmitting antennas
Wireless networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/GLOCOM.2003.1258262