Optimum number of hops of linear multi-hop networks with equidistant relays
Optimum number of hops of linear multi-hop networks with equidistant relays
复制标题
DOI：
10.1109/hmwc.2014.7000236
复制
发表时间：
2014-11
期刊：
影响因子：
--
通讯作者：
D. Hu;Jingxian Wu;P. Fan
中科院分区：
文献类型：
--
作者：
D. Hu;Jingxian Wu;P. Fan
研究了具有等距中继的线性多跳网络中使端到端时延最小的最佳跳数问题。在网络中，源节点通过其他节点作为中继将消息传递到目的节点。每一跳采用解码转发（DF）和自动重传请求（ARQ）。考虑两种情况：一种是噪声受限环境，另一种是干扰受限环境。这两个操作环境的平均端到端延迟推导出一些参数的封闭形式的表达式，如源-目的地的距离，跳数，传输和噪声功率等的分析结果，最佳的跳数，可以最大限度地减少这两种情况下的端到端延迟。
The optimum number of hops that can minimize the end-to-end delay of linear multi-hop networks with equidistant relays is studied in this paper. In the network, a source delivers message to its destination by using other nodes as relays. Each hop employs decode-and-forward (DF) with automatic repeat request (ARQ). Two scenarios are considered: one is a noise-limited environment, and the other is an interference-limited environment. The average end-to-end delays of both operation environment are derived as closed-form expressions of a number of parameters, such as the source-destination distance, the number of hops, the transmission and noise power, etc. With the analytical results, the optimum numbers of hops that can minimize the end-to-end delays of both scenarios are identified.