Abstrucr-We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair ( U , w) of nodes connected in the original network, there is a a minirnum-energy parh between U and w 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 in [13] . Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation.
In REF , a protocol is proposed which, given a communication network, computes a sub-network such that, for every pair (u, v) of nodes connected in the original network, there is a minimum-energy path u and v in the subnetwork where a minimum-energy path is the one that allows messages to be transmitted with a minimum use of energy.
Minimum-energy mobile wireless networks revisited
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)
ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)
Computer Science