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.
翻译:在本文中,我们考虑基于两个能源收获(EH)解码和前向(DF)中继器的多希望合作网络,这些中继器配有收割-储存-使用(HSU)结构,以利用能源缓冲来从宽度获取能源。为了推动网络的数据提供,在目的地将最大比率结合(MRC),以综合从源和中继收到的信号,以及考虑频道状态信息、位置和中继器的能源缓冲状态的机会性路由算法(OR)。在应用离散-时间连续空间Markov链模型(DCSMC)时,将基于算法的理论表达法的理论表达法用于限制在无限范围的缓冲中储存能源的分配。此外,在使用限制能源缓冲分布和设定发射者候选人的概率的同时,还获得了基于算法的理论表达法,用于计算网络每项数据的外差概率、吞吐量和时间溶解成本。模拟结果用于验证基于源算法的理论表达法的理论表达法。