arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1601.06859cs.ITcs.SYeess.SYmath.IT
收藏

无线中继信道的最优动态路由

Optimal Dynamic Routing for the Wireless Relay Channel

Asaf Cohen, Dennis Goeckel, Omer Gurewitz, Daniel S. Menasche, Mark Shifrin

AI总结:

研究在无线中继信道中如何根据信道状态和队列状态动态选择最佳路由方案,提出基于半马尔可夫决策过程的最优策略,并通过仿真验证其有效性。

摘要:

考虑一个包含源、中继和目的节点的通信网络。每个时间间隔,源可能根据信道状态、交通模式和自身队列状态动态选择几种可能的编码方案。例如,源可能选择直接路由到目的节点或中继辅助方案。显然,由于不同方案所实现的性能差异以及所使用的资源不同,发送方可能希望根据其状态选择最合适的方案。在本工作中,我们将问题建模为半马尔可夫决策过程。这种建模方法允许我们找到一个最优策略,该策略以源队列中包的数量和其他参数为函数。特别地,我们展示了一个通用解,涵盖了各种配置,包括不同的分组大小分布和变化的信道。此外,对于指数传输时间的情况,我们通过分析证明了最优策略具有阈值结构,即存在一个唯一的单一参数值,决定了哪种方案(或路由)最优。结果也通过几种有趣的模型进行了仿真验证。

英文摘要:

Consider a communication network with a source, a relay and a destination. Each time interval, the source may dynamically choose between a few possible coding schemes, based on the channel state, traffic pattern and its own queue status. For example, the source may choose between a direct route to the destination and a relay-assisted scheme. Clearly, due to the difference in the performance achieved, as well as the resources each scheme uses, a sender might wish to choose the most appropriate one based on its status. In this work, we formulate the problem as a Semi-Markov Decision Process. This formulation allows us to find an optimal policy, expressed as a function of the number of packets in the source queue and other parameters. In particular, we show a general solution which covers various configurations, including different packet size distributions and varying channels. Furthermore, for the case of exponential transmission times, we analytically prove the optimal policy has a threshold structure, that is, there is a unique value of a single parameter which determines which scheme (or route) is optimal. Results are also validated with simulations for several interesting models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑