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

随机信道状态下认知无线电网络盲重订策略的ETTR界及近似解

ETTR Bounds and Approximation Solutions of Blind Rendezvous Policies in Cognitive Radio Networks with Random Channel States

Cheng-Shang Chang, Duan-Shin Lee, Yu-Lun Lin, Jen-Hung Wang

摘要:

在本文中,我们考虑认知无线电网络(CRN)中的多信道会合问题,其中两个用户跳到同一个信道上的概率有一个成功的会合是信道状态的函数。信道状态由用户已知的联合分布的随机过程建模。然而,通道在任何时候的确切状态都是不可观测的。我们首先考虑两个信道模型:(i)快速时变信道模型(其中信道状态被假设为在每个时隙中独立且相同地分布),以及(ii)缓慢时变信道模型(其中信道状态随时间保持不变)。在根据一定的信道选择概率在信道上随机跳变的盲会合策略中,我们证明了在快时变信道模型中,使期望会合时间(ETTR)最小化的最优信道选择策略是一直在“最佳”信道上跳变的单一选择策略。然而,对于慢时变信道模型,寻找最优信道选择策略要困难得多。在信道状态为可交换随机变量的假设下,利用优序理论,得到了ETTR的上界和下界。在此基础上,我们证明了各种近似解。然后,我们将我们的结果扩展到一般的信道模型,其中信道状态的联合分布仅假设为在时间上是平稳的。

英文摘要:

In this paper, we consider the multichannel rendezvous problem in cognitive radio networks (CRNs) where the probability that two users hopping on the same channel have a successful rendezvous is a function of channel states. The channel states are modeled by stochastic processes with joint distributions known to users. However, the exact state of a channel at any time is not observable. We first consider two channel models: (i) the fast time-varying channel model (where the channel states are assumed to be independent and identically distributed in each time slot), and (ii) the slow time-varying channel model (where the channel states remain unchanged over time). Among the classes of the blind rendezvous policies that randomly hop on channels according to certain channel selection probabilities, we show the optimal channel selection policy that minimizes the expected time-to-rendezvous (ETTR) is the single selection policy that hops on the ``best'' channel all the time in the fast time-varying channel model. However, for the slow time-varying channel model, it is much more difficult to find the optimal channel selection policy. By using the majorization ordering, we derive a lower bound and an upper bound for the ETTR under the assumption that the channel states are exchangeable random variables. Bases on these bounds, we then prove various approximation solutions. We then extend our results to general channel models where the joint distribution of the channel states is only assumed to be stationary in time.

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

↑