论文标题
机会性路由协助合作通信MRC网络具有能量收获节点
Opportunistic Routing aided Cooperative Communication MRC Network with Energy-Harvesting Nodes
论文作者
论文摘要
在本文中，我们考虑了建立在两个能量收获（EH）解析（DF）继电器上建立的多跳合作网络，该网络配备了收获商店使用（HSU）结构，以使用能量缓冲液从氛围中收获能量。为了提高该网络中的数据传输，目的地最大比率组合（MRC）结合了从源和继电器接收到的信号，以及提出了相关的通道状态信息，位置和能量缓冲状态的机会性路由（或）算法。通过应用离散的连续状态太空马尔可夫链模型（DCSMC），得出了基于算法的理论表达式，用于限制在无限大小缓冲液中存储的能量的分布。此外，通过使用限制能量缓冲区的限制分布和候选发射器候选物的概率，可以获得基于算法的理论表达式，以实现网络每个数据的中断概率，吞吐量和时代托成成本。给出了仿真结果以验证基于算法的理论表达式。
In this paper, we consider a multi-hop cooperative network founded on two energy-harvesting (EH) decode-and-forward (DF) relays which are provided with harvest-store-use (HSU) architecture to harvest energy from the ambience using the energy buffers. For the sake of boosting the data delivery in this network, maximal ratio combining (MRC) at destination to combine the signals received from source and relays, as well as an opportunistic routing (OR) algorithm which considers channel status information, location and energy buffer status of relays is proposed. With applying discrete-time continuous-state space Markov chain model (DCSMC), the algorithm-based theoretical expression for limiting distribution of stored energy in infinite-size buffer is derived. Further more, with using both the limiting distributions of energy buffers and the probability of transmitter candidates set, the algorithm-based theoretical expressions for outage probability, throughput and timesolt cost for each data of the network are obtained. The simulation results are presented to validate the derived algorithm-based theoretical expressions.
