论文标题
基于混合ARQ的继电器策略，以提高延迟构建网络的可靠性
Hybrid-ARQ Based Relaying Strategies for Enhancing Reliability in Delay-Bounded Networks
论文作者
论文摘要
受到几个延迟限制任务的应用程序的启发，本文研究了基于追逐的混合自动重复请求（CC-HARQ）协议，以在延迟约束的应用程序中实现高可靠性。我们方法的一个显着特征是使用端到端延迟约束来计算网络中允许的ARQ总数，然后最佳地在节点上分配它们，以最大程度地减少数据包抛光验证性（PDP），这是端对端的可靠性可靠性度量。由于追逐策略将收到的数据包跨多次尝试结合在一起，因此我们观察到网络的PDP取决于中间无线通道的相干时间。结果，我们解决了在慢速和快速下降的情况下计算CC-HARQ策略最佳分配的问题的问题。对于两个通道条件，我们都会得出PDP的闭合形式表达式，然后制定了几个优化问题，以最大程度地减少给定延迟结合的PDP。利用对优化问题的局部最小值的广泛理论结果，我们合成低复杂性算法以获得近乎最佳的ARQ分布。除了使用广泛的仿真结果来验证我们的发现外，还提供了详细的端到端延迟分析，以表明所提出的CC-HARQ策略在几种情况下都超过了已知的已知1型ARQ策略。
Inspired by several delay-bounded mission-critical applications, this paper investigates chase-combining-based hybrid automatic repeat request (CC-HARQ) protocols to achieve high reliability in delay-constrained applications. A salient feature of our approach is to use the end-to-end delay constraint for computing the total number of ARQs permitted in the network, and then optimally distributing them across the nodes so as to minimize packet-drop-probability (PDP), which is the end-to-end reliability metric of interest. Since the chase-combining strategy combines the received packets across multiple attempts, we observe that the PDP of the network depends on the coherence-time of the intermediate wireless channels. As a result, we address the question of computing optimal allocation of ARQs for CC-HARQ strategies under both slow-fading and fast-fading scenarios. For both the channel conditions, we derive closed-form expressions for the PDP, and then formulate several optimization problems for minimizing the PDP for a given delay-bound. Using extensive theoretical results on the local minima of the optimization problems, we synthesize low-complexity algorithms to obtain near-optimal ARQ distributions. Besides using extensive simulation results to validate our findings, a detailed end-to-end delay analysis is also presented to show that the proposed CC-HARQ strategies outperform already known Type-1 ARQ based strategies in several scenarios.
