...
首页> 外文期刊>Journal of industrial and management optimization >OPTIMAL DESIGN AND ANALYSIS OF A TWO-HOP RELAY NETWORK UNDER RAYLEIGH FADING FOR PACKET DELAY MINIMIZATION
【24h】

OPTIMAL DESIGN AND ANALYSIS OF A TWO-HOP RELAY NETWORK UNDER RAYLEIGH FADING FOR PACKET DELAY MINIMIZATION

机译:瑞利衰落下分组延迟最小化的两跳中继网络的优化设计与分析

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

摘要

In this paper, we consider a wireless network consisting of a source node, a destination node and multiple relay nodes under Rayleigh fading. Cooperative diversity in the network is achieved by selecting an opportunistic relay node with the best channel condition to the destination node. We focus on the packet level performance in this paper and analyze the average packet delay of the network for various modulation and coding schemes. We assume that the arrival process of packets follows a Markov modulated Poisson process (MMPP). To derive the average packet delay, we first derive the distribution of the number of packets that are successfully transmitted from the source node to the destination node via a relay node. Using the distribution obtained above, a queueing process of the M/G/1 type is developed to model the queue at the source node. The average packet delay is then obtained from the stationary distribution of the queueing process of the source node by applying Little's Lemma. Based on our results on the average packet delay, the optimal modulation and coding scheme for given network parameters is determined to minimize the average packet delay. We validate our analytic model through simulation. The detailed relations between the average packet delay and network parameters such as average signal to noise ratios (SNRs) between nodes, the number of relay nodes and packet arrival rate, are investigated through numerical studies based on our analytic model as well as simulation studies. Prom our numerical results, we conclude that the optimal modulation and coding scheme that minimizes the average packet delay depends not only on SNRs of channels between nodes but also on the arrival rate of packets at the data link layer.
机译:在本文中,我们考虑在瑞利衰落下由源节点,目的节点和多个中继节点组成的无线网络。通过选择到目的节点的信道条件最佳的机会中继节点,可以实现网络中的协作分集。在本文中,我们重点关注数据包级别的性能,并分析了各种调制和编码方案的网络平均数据包延迟。我们假设数据包的到达过程遵循马尔可夫调制泊松过程(MMPP)。为了得出平均数据包延迟,我们首先得出通过中继节点从源节点成功传输到目标节点的数据包数量的分布。使用上面获得的分布,开发了M / G / 1类型的排队过程以对源节点处的队列进行建模。然后,通过应用Little's Lemma从源节点排队过程的平稳分布中获得平均数据包延迟。根据我们在平均数据包延迟上的结果,确定给定网络参数的最佳调制和编码方案,以最大程度地减少平均数据包延迟。我们通过仿真验证了我们的分析模型。通过基于我们的分析模型和仿真研究的数值研究,研究了平均数据包延迟与网络参数之间的详细关系,例如节点之间的平均信噪比(SNR),中继节点数和数据包到达率。证明我们的数值结果,我们得出的结论是,使平均数据包延迟最小的最佳调制和编码方案不仅取决于节点之间通道的信噪比,还取决于数据包在数据链路层的到达率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号