Minimum-energy mobile wireless networks revisited

We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair (u, υ) of nodes connected in the original network, there is a a minimum-energy path between u and υ in the subnetwork (where a minimum-energy path is one that allows messages to be transmitted with a minimum use of energy). The network computed by our protocol is in general a subnetwork of the one computed by the protocol given by Rodoplu and Meng (see IEEE J. Selected Areas in Communications, vol.17, no.8, p.1333-44, 1999). Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation