2017/01/30 by Endrit Dosti, Uditha Lakmal Wijewardhana, Uditha Wijewardhana +7 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Interconnection Networks and Systems #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1701.08617
Accepted IEEE ICC 2017, May 21-25, Paris, France
arxiv created 2017/01/30 · openalex publication_date 2017/01/30 · arxiv updated 2017/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We analyze the performance of the type-I automatic repeat request (ARQ) protocol with ultra-reliability constraints. First, we show that achieving a very low packet outage probability by using an open loop setup is a difficult task. Thus, we introduce the ARQ protocol as a solution for achieving the required low outage probabilities for ultra reliable communication. For this protocol, we present an optimal power allocation scheme that would allow us to reach any outage probability target in the finite block-length regime. We formulate the power allocation problem as minimization of the average transmitted power under a given outage probability and maximum transmit power constraint. By utilizing the Karush-Kuhn-Tucker (KKT) conditions, we solve the optimal power allocation problem and provide a closed form solution. Next, we analyze the effect of implementing the ARQ protocol on the throughput. We show that by using the proposed power allocation scheme we can minimize the loss of throughput that is caused from the retransmissions. Furthermore, we analyze the effect of the feedback delay length in our scheme.