...
首页> 外文期刊>IEEE Transactions on Vehicular Technology >Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size
【24h】

Achieving Optimal Diversity Gain in Buffer-Aided Relay Networks With Small Buffer Size

机译:在缓冲区较小的缓冲区辅助中继网络中实现最佳分集增益

获取原文
获取原文并翻译 | 示例
           

摘要

This paper investigates the buffer-aided relay selection problem for a decode-and-forward cooperative wireless network with K relays. We propose a new relay selection scheme that incorporates the status of the relay buffers and the instantaneous strength of the wireless links. Specifically, each link is assigned with a weight related to the buffer status; then, the best relay is selected with the largest weight among all the qualified source–relay and relay–destination links. We derive the closed-form expression for the outage probability and the diversity gain by introducing several Markov chains (MCs) to model the evolution of the buffer status. The analysis shows that the proposed scheme can achieve the optimal diversity gain 2K for a small L (i.e., L≥3), an improvement in comparison with the existing max-link scheme that achieves the optimal diversity gain only when L is sufficiently large, where L denotes the buffer size of each relay. The provided theoretical and numerical results confirm the performance gain of the proposed relay selection scheme over the existing max-link scheme.
机译:本文研究了具有K个中继的解码和转发协作无线网络的缓冲区辅助中继选择问题。我们提出了一种新的中继选择方案,该方案结合了中继缓冲区的状态和无线链路的瞬时强度。具体而言,为每个链接分配与缓冲区状态有关的权重;然后,在所有合格的源-中继和中继-目标链路中,选择权重最大的最佳中继。通过引入几个马尔可夫链(MC)来建模缓冲区状态的演化,我们得出了中断概率和分集增益的闭式表达式。分析表明,该方案可以在较小的L(即L≥3)下实现最佳分集增益2K,与现有的仅在L足够大时才能实现最佳分集增益的最大链路方案相比有所改进,其中L表示每个中继的缓冲区大小。提供的理论和数值结果证实了所提出的中继选择方案相对于现有的最大链路方案的性能增益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号