Optimal spectrum-efficient routing in multihop wireless networks

This paper addresses the problem of finding the route with maximum end-to-end spectral efficiency, under the constraint of equal bandwidth sharing, in multihop wireless networks. This problem has been addressed recently in the literature, and only exhaustive search with exponential computational complexity or suboptimal heuristics are known. This paper closes the algorithmic gap by introducing two algorithms that provide provably optimal solutions to the problem in polynomial-time. The proposed algorithms rely on the iterative use of a shortest path procedure. Our computational results further illustrate the efficiency of the proposed approach.