Skip to main content
Article thumbnail
Location of Repository

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

By Arindam K. Das, Robert J. Marks, Mohamed El-sharkawi, Payman Arabshahi and Andrew Gray

Abstract

Abstract—We consider the problem of maximizing the timeto-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. I

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.2378
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://web.ecs.baylor.edu/facu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.