论文标题
通过动态编程的多用户多跳力中继网络的最佳路由
Optimal Routing for Multi-user Multi-hop Relay Networks via Dynamic Programming
论文作者
论文摘要
在本文中，我们研究了多用户多跳继电器网络中的继电器选择问题，目的是最大程度地减少所有用户的最大停战概率。当只有一个用户存在时，众所周知，最佳继电器选择问题可以通过动态编程有效地解决。由于用户之间的依赖性，该解决方案在多用户方案中分解。我们使用一种新颖的继电器聚合方法来解决这一挑战。在扩展的格子上，可以使用动态编程来解决最佳的继电器选择问题，并用啤酒花数中的计算复杂性线性。数值示例说明了该算法在中继网络中的有效使用。
In this paper, we study the relay selection problem in multi-user, multi-hop relay networks with the objective of minimizing the maximum outage probability across all users. When only one user is present, it is well known that the optimal relay selection problem can be solved efficiently via dynamic programming. This solution breaks down in the multi-user scenario due to dependence between users. We resolve this challenge using a novel relay aggregation approach. On the expanded trellis, dynamic programming can be used to solve the optimal relay selection problem with computational complexity linear in the number of hops. Numerical examples illustrate the efficient use of this algorithm for relay networks.
