A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we present three energy efficient broadcast and multicast routing algorithms for wireless ad hoc networks. The first algorithm computes a broadcast tree whose energy consumption is within a factor 2 + 2 ln (n – 1) of the optimal. The second algorithm computes a multicast tree whose energy consumption is within a constant factor of the optimal.Our third algorithm, for a multicast request with a given duration, computes an optimal multicast tree such that the minimal remaining energy of nodes is maximized after the multicast session. This algorithm helps to maximize the lifetime of the network.