Selective-repeat Automatic Repeat Request Protocol Research Articles

Truncated-ARQ Aided Adaptive Network Coding for Cooperative Two-Way Relaying Networks: Cross-Layer Design and Analysis

Network Coding (NC) constitutes a promising technique of improving the throughput of relay-aided networks. In this context, we propose a cross-layer design for both amplifyand- forward (AF-) and decode-and-forward two-way relaying (DF-TWR) based on the NC technique invoked for improving the achievable throughput under specific Quality of Service (QoS) requirements, such as the maximum affordable delay and error rate.We intrinsically amalgamate adaptive Analog Network Coding (ANC) and Network Coded Modulation (NCM) with truncated Automatic Repeat reQuest (ARQ) operating at the different OSI layers. At the data-link layer, we design a pair of improved NC-based ARQ strategies based on the Stop-andwait and the Selective-repeat ARQ protocols. At the physical layer, adaptive ANC/NCM are invoked based on our approximate packet error ratio (PER). We demonstrate that the adaptive ANC design can be readily amalgamated with the proposed protocols. However, adaptive NC-QAM suffers from an SNR-loss, when the transmit rates of the pair of downlink (DL) channels spanning from the relay to the pair of destinations are different. Therefore we develop a novel transmission strategy for jointly selecting the optimal constellation sizes for both of the relay-to-destination links that have to be adapted to both pair of channel conditions. Finally, we analyze the attainable throughput, demonstrating that our truncated ARQ-aided adaptive ANC/NCM schemes attain considerable throughput gains over the schemes dispensing with ARQ, whilst our proposed scheme is capable of supporting bidirectional NC scenarios.

무선 환경에서 TCP 스퓨리어스 타임아웃 방지를 위한 SR-ARQ 재전송 지속성 관리 방안

To detect and recover packet losses over wireless links is very important in terms of reliability in packet transmission. Most wireless communication systems adopt an automatic repeat request (ARQ) protocol operating at link layer. However, it has been constantly addressed that the interaction not harmonized sufficiently between ARQ and TCP rather degrades TCP performance. In this paper, therefore, we propose an improved scheme from the aspect of the interaction with TCP loss recovery mechanism that can be applied to selective repeat ARQ (SR-ARQ) protocol and prove that the proposed scheme improves TCP performance significantly by OPNET simulations.

Selective automatic repeat quantum synchronous communication protocol based on quantum entanglement

From the classical selective repeat ARQ (Automatic Repeat-reQuest) protocol, a selective repeat ARQ quantum synchronous communication protocol in data link layer is presented by utilizing the intrinsic characteristics of quantum mechanics. The proposed protocol divides the link into the preparation and the send stages, where the message is sent via classical channel and the preparation and distribution of EPR (Einstein-Podolsky-Rosen) pairs are supposed to be accomplished at the preparation stage. The performances of several protocols in data link layer are compared and analyzed from the aspects of throughput and utilization ratio of the channel. It is shown that the proposed protocol enhances the maximum throughput and the utilization ratio of the channel effectively and improves the performance of the selective repeat ARQ protocol for date link layers. The proposed protocol is of great significance in military communications.

제한된 재전송 횟수를 지원하는 SR-ARQ 프로토콜의 큐잉 지연 분석 모델

In this paper, we analyze the mean queuing delay of selective-repeat automatic repeat request (SR-ARQ) protocol with the finite retransmission persistence. The retransmission persistence means the willingness of the protocol to retransmit a lost (or corrupted) packet to ensure reliable packet delivery across a lossy link. According to the retransmission persistence, SR-ARQ protocols have a different performance in terms of both packet delay and link reliability. So far, however, there is no serious study in the effect of the retransmission persistence on the SR-ARQ performance. We present a simple M/G/1 queuing model for the SR-ARQ protocol with the finite retransmission persistence by using the ideal SR-ARQ approximation. The mean queuing delay is obtained from the queuing model and verified its accuracy through the simulation results using the OPNET simulator. Both the analytical predictions and simulation results clearly show the effect of retransmission persistence on the queuing delay of the SR-ARQ protocol in various network conditions: packet loss rate and traffic condition over a wireless link.

Queueing Analysis for GBN and SR ARQ Protocols under Dynamic Radio Link Adaptation with Non-Zero Feedback Delay

We present a queueing model for performance analysis of go-back-N (GBN) and selective repeat (SR) automatic repeat request (ARQ) protocols in wireless networks using dynamic radio link adaptation with non-instantaneous feedback. Link adaptation technique allows multi-rate transmission which is assumed to be achieved through adaptive modulation and coding. The radio link level queueing models for these two ARQ protocols are formulated in discrete time where the exact queue length and the delay statistics are obtained by using matrix geometric methods under different feedback delay values, channel and system parameters. The link layer delay statistics are useful in many ways, for example, to perform packet level admission control under statistical delay constraints. We validate the analysis by simulation and discuss useful implications of the analytical model on system performance. For dynamic link adaptation, the mode switching thresholds for the received signal-to-noise ratio (SNR) can be chosen to obtain very good link level delay performance. This SNR partitioning is shown to achieve significant cross-layer design gain compared to the case where the mode switching thresholds are chosen to maximize the physical layer throughput.

Delay Analysis of the Selective-repeat ARQ Protocol with the Per-Flow Resequencing Scheme

An SR (Selective-Repeat) ARQ (Automatic Repeat reQuest) protocol is used to recover from packet errors effectively over a low-quality communication channel. This SR ARQ has a problem of large delay due to resequencing of received packets. To mitigate this problem, the PFRS (Per-Flow ReSequencing) scheme was proposed, where the resequencing is performed independently for each upper-layer flow, while detection of lost packets and associated retransmissions are performed on the basis of the whole flows multiplexed over SR ARQ. This paper models the SR ARQ protocol, where the maximum number of retransmissions is limited, by a collection of simple stop-and-wait protocols, and shows numerical calculation results for the delay distribution of retransmission and resequencing. The validity of the analysis is confirmed by comparing numerical calculations with simulation results. The results prove the effectiveness of the PFRS scheme for the case where the number of flows over SR ARQ is large.

Adaptive Modulation/TDMA/TDD with Convolutionally Coded Type-II HybridARQ for Wireless Communication Systems

This paper proposes a time division multiple access/time division duplex (TDMA/TDD)-based adaptive modulation system (AMS) with a convolutionally coded Type-II Hybrid automatic repeat request (ARQ) protocol to achieve high throughput data transmission in wireless communication systems. First, this paper discusses the cause of throughput limitation of the conventional fixed-rate quaternary phase shift keying (QPSK) with ARQ protocol and suggests that the effective means to improve throughput performance are the reduction of re-transmission probability under bad channel condition and the increase of transmission bit rate per TDMA/TDD slot under good channel condition. Based on these strategies, this paper discusses an AMS with a convolutionally coded type-II hybrid ARQ protocol (type-II hybrid ARQ/AMS) and evaluates its performance by computer simulation. The results confirm that the proposed type-II hybrid ARQ/AMS can drastically improve throughput performances compared to the conventional fixed-rate QPSK with selective repeat ARQ protocol (SR-ARQ/QPSK) or a simple combination of SR-ARQ and AMS (SR-ARQ/AMS) under any channel conditions, especially under severe channel conditions.

A proof of quasi-independence of sliding window flow control and go-back- n error recovery under independent packet errors

A quasi-independence result holds for the go-back- n automatic repeat request (ARQ) protocol and the sliding window flow control protocol if packet errors are independent. The result is independent of the magnitude of the packet error probability or the cost of an error. A parallel result for the selective repeat ARQ protocol, however, does not appear to hold.

Waiting time and queue length distributions for go-back-N and selective-repeat ARQ protocols

The paper provides a performance analysis of automatic-repeat-request (ARQ) protocols in connection-oriented transmission. Each message arriving at a transmitter is divided into several packets, which are continuously transmitted to a receiver according to go-back-N ARQ or selective-repeat ARQ protocols. Because of connection-oriented transmission, messages are served on a first come first served basis, i.e., transmission of a message is commenced after all packets in the previous message are successfully transmitted. For the two ARQ protocols, the authors derive the probability generating functions of message waiting time and queue length at an arbitrary instant, from which the average performance measures are explicitly obtained.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Performance Analysis of the Selective Repeat ARQ Protocol

Delay, queue length, and throughput are the main performance characteristics of a data transmission system with ARQ (automaticrepeat-request) error control. Various protocols which have been proposed use, as a part or as a whole, the basic selective-repeat ARQ protocol. Their performance analysis has, however, been restricted to the throughput characteristics. An easily applicable method to analyze this basic protocol has not appeared in the literature so far. In this paper, two different methods for the queue length and delay analysis are presented. The system is modeled as a discrete time queue with infinite buffer storage. Transmission errors are considered to be independent, and block arrivals may follow an arbitrary interarrival time distribution. The first method uses an exact Markov state model, on which the theory of absorbing and ergodic Markov chains is applied, and leads to a computational algorithm. The second method, which is based on a specific assumption, uses a substantially simpler stochastic model and results in equations which are easily solved by means of iterative computation. In the case of geometrically distributed interarrival times, simple analytical formulas are extracted. The results are compared to the exact ones (that is, those obtained by the first method or by extended simulation runs) and surprising agreement is observed.