两个相同Gilbert-Elliott信道上的最优功率分配策略
Optimal Power Allocation Policy over Two Identical Gilbert-Elliott Channels
摘要:
本文研究了两个完全相同的Gilbert-Elliott(Binary Markov)通信信道的最优功率分配问题。我们的目标是通过明智地选择每个时隙的四个动作之一来最大化在无限时间跨度上传输的比特的预期折扣数:1)将功率相等地分配给两个信道,2)将所有功率分配给信道1,3)将所有功率分配给信道2,以及4)不将功率分配给任何信道。由于信道状态是未知的功率分配决策时,我们建模这个问题作为一个部分可观察的马尔可夫决策过程(POMDP),并推导出最佳的政策,给出了最佳的行动,在不同的可能的信道状态。两种不同的结构的最优策略的解析推导和验证线性规划模拟。我们还说明了如何构造最优策略的阈值计算和线性规划模拟相结合,一旦系统参数已知。
英文摘要:
We study the fundamental problem of optimal power allocation over two identical Gilbert-Elliott (Binary Markov) communication channels. Our goal is to maximize the expected discounted number of bits transmitted over an infinite time span by judiciously choosing one of the four actions for each time slot: 1) allocating power equally to both channels, 2) allocating all the power to channel 1, 3) allocating all the power to channel 2, and 4) allocating no power to any of the channels. As the channel state is unknown when power allocation decision is made, we model this problem as a partially observable Markov decision process(POMDP), and derive the optimal policy which gives the optimal action to take under different possible channel states. Two different structures of the optimal policy are derived analytically and verified by linear programming simulation. We also illustrate how to construct the optimal policy by the combination of threshold calculation and linear programming simulation once system parameters are known.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。