arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.6771cs.ITmath.IT
收藏

多个相同Gilbert-Elliott信道的最优功率分配

Optimal Power Allocation over Multiple Identical Gilbert-Elliott Channels

Jiaming Li, Junhua Tang, Bhaskar Krishnamachari

摘要:

我们研究了多个Gilbert-Elliott通信信道的功率分配问题。在具有时变信道质量的通信系统中,重要的是将有限的传输功率分配给将处于良好状态的信道。然而,这是非常具有挑战性的,因为信道状态通常是未知的功率分配决策时,这样做。在本文中,我们推导出一个最佳的功率分配策略,可以最大限度地提高预期的折扣数量的比特传输在一个无限的时间跨度分配的传输功率,只有那些信道被认为是好的,在未来的时隙。我们使用的概念信念表示的概率,信道将是好的,并得出一个最佳的功率分配策略,建立一个映射的信道信念的分配决定。具体来说,我们首先将此问题建模为部分可观测马尔可夫决策过程(POMDP),并分析研究了最优策略的结构。然后,一个简单的阈值为基础的政策,推导出一个三信道通信系统。通过制定和解决这个功率分配问题的线性规划公式,我们进一步验证了导出的最优策略的结构。

英文摘要:

We study the fundamental problem of power allocation over multiple Gilbert-Elliott communication channels. In a communication system with time varying channel qualities, it is important to allocate the limited transmission power to channels that will be in good state. However, it is very challenging to do so because channel states are usually unknown when the power allocation decision is made. In this paper, we derive an optimal power allocation policy that can maximize the expected discounted number of bits transmitted over an infinite time span by allocating the transmission power only to those channels that are believed to be good in the coming time slot. We use the concept belief to represent the probability that a channel will be good and derive an optimal power allocation policy that establishes a mapping from the channel belief to an allocation decision. Specifically, we first model this problem as a partially observable Markov decision processes (POMDP), and analytically investigate the structure of the optimal policy. Then a simple threshold-based policy is derived for a three-channel communication system. By formulating and solving a linear programming formulation of this power allocation problem, we further verified the derived structure of the optimal policy.

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

↑