Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
