Name
Title | ||
|---|---|---|
MDLT: a polynomial time optimal algorithm for maximization of time-to-first- failure in energy constrained wireless broadcast networks |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/GLOCOM.2003.1258262 | Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE |
Keywords | Field | DocType |
optimisation,polynomials,radio networks,battery energy,battery residual capacities,greedy algorithm,polynomial time optimal algorithm,power matrix,time-to-first- failure maximization,wireless broadcast networks | Residual,Wireless network,Broadcasting,Mathematical optimization,Polynomial,Matrix (mathematics),Computer science,Algorithm,Greedy algorithm,Time complexity,Maximization | Conference |
Volume | ISBN | Citations |
1 | 0-7803-7974-8 | 5 |
PageRank | References | Authors |
0.51 | 2 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arindam K. Das | 1 | 180 | 8.77 |
| Robert J. Marks | 2 | 254 | 55.90 |
| Mohamed El-Sharkawi | 3 | 5 | 1.52 |
| Payman Arabshahi | 4 | 82 | 9.64 |
| Andrew Gray | 5 | 55 | 5.32 |
| Marks, R.J., II | 6 | 165 | 46.04 |
| El-Sharkawi, M. | 7 | 29 | 2.71 |