A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Minimum energy disjoint path routing in wireless ad-hoc networks
2003
Proceedings of the 9th annual international conference on Mobile computing and networking - MobiCom '03
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. In addition, we present efficient heuristic algorithms for both problems. Our results show that link-disjoint paths consume substantially
doi:10.1145/938998.938999
fatcat:ybifnh5fefbz5pawmexqccbxky