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

关于多状态信道中贪心感知的最优性

On The Optimality of Myopic Sensing in Multi-State Channels

Department of EECS,University of Michigan(密歇根大学电气与计算机工程学院)

Yi Ouyang, Demosthenis Teneketzis

AI总结:

研究多状态信道中贪心感知策略的最优性,基于马尔可夫链模型,探讨在有限或无限时间范围内最大化总奖励的策略设计,发现贪心策略在特定条件下等同于Gittins指数规则。

摘要:

我们考虑在衰落信道中机会性调度、认知无线电网络和资源受限干扰中的信道感知问题。通信系统由N个信道组成,每个信道建模为多状态马尔可夫链(M.C.)。在每个时间点,用户选择一个信道进行感知并传输信息。每次传输根据所选信道的状态获得奖励。目标是设计一个信道感知策略,以最大化有限或无限时间范围内预期总奖励。该问题可视为 restless bandit 问题的一个实例,其中最优策略的形式在一般情况下未知。我们发现一组保证贪心感知策略最优的条件;我们证明在特定条件下,贪心策略等同于Gittins指数规则。

英文摘要:

We consider the channel sensing problem arising in opportunistic scheduling over fading channels, cognitive radio networks, and resource constrained jamming. The communication system consists of N channels. Each channel is modeled as a multi-state Markov chain (M.C.). At each time instant a user selects one channel to sense and uses it to transmit information. A reward depending on the state of the selected channel is obtained for each transmission. The objective is to design a channel sensing policy that maximizes the expected total reward collected over a finite or infinite horizon. This problem can be viewed as an instance of a restless bandit problem, for which the form of optimal policies is unknown in general. We discover sets of conditions sufficient to guarantee the optimality of a myopic sensing policy; we show that under one particular set of conditions the myopic policy coincides with the Gittins index rule.

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

↑