Optimal spectrum-efficient routing in multihop wireless networks
Optimal spectrum-efficient routing in multihop wireless networks
复制标题
DOI：
10.1109/twc.2009.12.090546
复制
发表时间：
2009-12
影响因子：
10.4
通讯作者：
M. Saad
中科院分区：
文献类型：
--
作者：
M. Saad
本文研究了多跳无线网络中，在带宽共享相等的约束下，如何找到具有最大端到端频谱效率的路由问题。这个问题最近已经在文献中得到了解决，只有指数计算复杂度或次优搜索的穷举搜索是已知的。本文通过引入两种算法，在多项式时间内提供问题的可证明的最优解，从而缩小了算法的差距。所提出的算法依赖于迭代使用的最短路径过程。我们的计算结果进一步说明了所提出的方法的效率。
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.