Adapative arq schemes and their performance evaluation under full‐duplex transmission

An adaptive control procedure is proposed for the go-back-N and selective-repeat automatic repeat-request (ARQ) schemes. The procedure is to dynamically vary the number and length of continuously transmitted data blocks according to the bit error rate. The throughput of the adaptive ARQ schemes for a half-duplex transmission line is compared with the throughput of corresponding conventional schemes. Numerical results indicate that adaptive ARQ schemes are superior to conventional ARQ schemes when the bit error rate is not known or varies with time.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

We propose and analyze a scheme for wireless channels, which is a combination of a hybrid type I automatic repeat request (ARQ) scheme and a power ramping. In the hybrid type I ARQ scheme, the same redundancy bits for error correction is transmitted repeatedly when a negative acknowledgment (NAK) is obtained. In addition to the ARQ scheme, the power ramping is considered for more reliable downlink data transmission, in which the transmission power is gradually changed from a small level to large levels when the number of retransmission increases. This is done without any knowledge of the channels at the transmitter. Simulation results show that by applying the combined hybrid ARQ and power ramping scheme with properly selected parameters, it has a throughput advantage of 3-5%.

Power-line communication (PLC) networks have been increasingly used for constructing industrial IoT (internet of things) and home networking systems due to their low-cost installation and broad coverage feature. To guarantee the transmission reliability, ARQ (automatic repeat request) scheme is introduced into the link layer of reliable PLC networks, which allows the retransmission of a data frame several times so that it has a higher probability to be correctly received. However, current studies of performance analysis for PLC MAC (medium access control) protocol (i.e., IEEE 1901) do not take into account of the impact of ARQ scheme. To resolve this problem, we propose an analytical model to investigate the MAC performance of IEEE 1901 protocol for reliable PLC networks with ARQ scheme. In the modeling process, we first establish a PLC channel model to reflect the impacts of PLC channel types (containing Rayleigh fading and Log-normal fading), additive non-Gaussian noise feature and ARQ scheme on data transmission at link layer. Next, we employ Renewal theory and Queueing dynamics to capture the transmission attempt behavior of executing IEEE 1901 protocol in the unsaturated environment with finite transit buffer size. On the basis of combining these two models, we derive the closed-form expressions of 1901 MAC metrics considering the influence of the ARQ scheme. Furthermore, we prove that the proposed analytical model has the convergence property. Finally, we evaluate the MAC performance of 1901 protocol for reliable PLC networks with ARQ scheme and verify the proposed analytical model.

Various Automatic Repeat Request (ARQ) schemes have been used to combat errors that befall information transmitted in digital communication systems. Such schemes include simple ARQ, mixed mode ARQ and Hybrid ARQ (HARQ). In this study we introduce extended ARQ schemes and derive expressions for their throughput performance. We then compare their performance with mixed mode ARQ schemes where it is shown that extended ARQ schemes outperform the mixed mode ARQ schemes. We also show how the parameters for the schemes can be chosen to maximize performance.Keywords: ARQ, extended ARQ, HARQ, mixed mode ARQ, throughput

In an automatic repeat request (ARQ) scheme, a packet is retransmitted if it gets corrupted due to transmission errors caused by the channel. Here we describe a ready-to-implement ARQ scheme with packet combining. An analytical description of the scheme in random error channel shows excellent agreement with simulation results. An upper bound for type-II schemes is defined. For smaller packet sizes, throughput of the proposed scheme is sufficiently close to the upper bound till a very high bit error rate.

Sequential decoding is analyzed in conjunction with an efficient incremental redundancy automatic repeat request (ARQ) scheme using punctured convolutional coding. With the incremental redundancy ARQ scheme, whenever the decoding time of a given data packet exceeds some predetermined value T/sub max/, decoding of that data packet is stopped and incremental redundancy bits are provided by the transmitter, a few bits at a time, as needed. It is shown that the incremental redundancy ARQ scheme provides throughput improvement over the partial retransmission code combining ARQ scheme. The advantage of the incremental redundancy ARQ scheme is that the throughput increases as the starting coding rate increases over all ranges of signal-to-noise ratios. >

An automatic repeat-request (ARQ) scheme with memory and soft error detectors has been recently proposed by Benelli. Its performance was studied mainly through computer simulation. In this paper, a generalized version of this ARQ scheme is examined. The selection of certain thresholds and weights to minimize the bit error rate in systems using a fixed number of packet repeats is considered. Finally, the evaluation of the average number of transmissions per packet in systems in which negatively acknowledged packets are retransmitted until successfully received is described.

This paper proposes a new automatic repeat request (ARQ) scheme for reliable broadcasting in distributed wireless LANs. Unlike traditional ARQ schemes for reliable broadcasting, the proposed scheme is highly efficient in its ARQ control information delivery and only introduces light control overhead in the network. Our simulation results show that as compared with traditional ARQ schemes, the proposed scheme improves the LAN throughput by from several tens to more than one hundred percent, depending on the number of nodes in the LAN.

In this paper1, we investigate different practical automatic repeat request (ARQ) retransmission protocols for twowaywireless relay networks based on network coding (NC). Theidea of NC is applied to increase the achievable throughput for the exchange of information between two terminals through one relay. Using NC, throughput efficiency is significantly improved due to the reduction of the number of retransmissions. Particularly, two improved NC-based ARQ schemes are designed based on go-back-N and selective-repeat (SR) protocols. The analysis of throughput efficiency is then carried out to find the best retransmission strategy for different scenarios. It is shown that the combination of improved NC-based SR ARQ scheme in the broadcast phase and the traditional SR ARQ scheme in themultiple access phase achieves the highest throughput efficiency compared to the other combinations of ARQ schemes. Finally, simulation results are provided to verify the theoretical analysis.

Adaptive stop-and-wait ARQ strategy for mobile data communications

A type-1 hybrid automatic-repeat-request (ARQ) scheme with time diversity combining is proposed and its performance analysed for binary digital FM (BFM) mobile radio communications. Time diversity combining is achieved by exploiting the packet retransmission nature inherent in the ARQ scheme. The ARQ scheme employs a high-rate error-correcting code with either hard-decision decoding or soft-decision decoding. Received signal envelopes are sampled and used as channel state information (CSI) in the decoding process. Numerical results on the system throughput and decoded bit error rate (BER) are presented as functions of average information signal-to-noise ratio, average information signal-to-interference ratio, and random FM noise.

This paper outlines an efficient method to concurrently optimize a multiplicity of design variables for continuous selective-repeat (SR) and go-back-N (GBN) automatic repeat request (ARQ) strategies, both in noiseless and noisy feedback channels. For these ARQ protocols, we adapt either the number of identical message blocks sent in each transmission (in the case of GBN scheme) or the number of copies of a block retransmitted to handle a NACKed codeword (for the SR protocol) dynamically to the estimated channel condition. The channel state information is obtained by counting the contiguous acknowledgment (ACK or NACK) messages. Exploiting the asymptotic properties of the steady state probability expressions, we show analytically that the optimum solution indeed lies in the infinite space. Subsequently, a simple expression to estimate the suboptimal design parameters is suggested. Our approach of minimizing the mean-square error function yields to a quantitative study of the appropriateness of the selected parameters. Exact analytical expressions that allows us to compute the throughput crossover probability between any two arbitrary multicopy transmission modes are derived. The results provide fundamental insights into how these key parameters interact and determine the system performance.

Due to limited buffer space available at routers, the packets in the Internet gets lost or dropped, especially when the network is congested. Automatic repeat request (ARQ), is an error-control method that uses acknowledgments and timeouts to decide retransmission of messages to achieve reliable data transmission. However, the re-transmission of a lost packet further increases the congestion in the network, and hence the end-to-end delay of other coexisting flows. This paper aims at improving the performance of ARQ schemes by introducing a lightweight re-transmission mechanism called LW-ARQ based on the concept of caching of packets at intermediate routers that are indented to be dropped. To evaluate the performance of proposed LW-ARQ scheme, we chose to implement it over TCP protocol considering that TCP has become a de-facto transport layer protocol standard for the Internet. However, the proposed LW-ARQ scheme can be integrated with any protocol that uses either stop-and-wait or sliding window based ARQ scheme to handle packet losses. On analyzing the results obtained by performing simulations, we found that the proposed LW-ARQ scheme improves the average end-to-end delay performance of the TCP protocol.

We introduce an analytical method that uses a finite-state Markov chain (FSMC) as an error model, for estimating the performance of adaptive modulation systems (AMSs) combined with automatic repeat request (ARQ) schemes in correlated slow fading channels. For the throughput performance evaluation of wireless packet networks, conventionally, we have assumed independent block fading, which may also be suitable to represent fast fading channels. However, in slow fading channels, error rates of consecutive packets are highly correlated and we cannot simply assume independent error structure in performance evaluations. We propose a multistate Markov error structure for AMS in correlated fading channels, which is also described by a finite-state Markov chain (FSMC) and we also present throughput-estimation methods for AMS combined with ARQ, using the proposed Markov error structure.

Many of the communication protocols require an error free transmission of data which cannot be guaranteed by using only a forward error correction technique. For packet switched communications, quite a number of ARQ (automatic repeat request) protocols have been designed which are able to cope with stringent memory requirements, but they either lack safety at high block error rates, or they require a large bandwidth due to low throughput. We introduce two simple and effective strategies (called Stutter-XOR or SXOR and XOR selective repeat or XOR-SR strategies) to increase throughput of existing protocols. In contrast to existing hybrid schemes (combinations of ARQ and forward error correction), the SXOR strategy does not only correct bit errors occurring on radio channels, but also handles block losses caused by buffer overflow in gateways, routers and receivers with limited buffer capacity. This is achieved by sending additional blocks, so called XOR blocks, which are created by combining other blocks using the XOR (modulo-2-addition) operation. We developed several variants of this strategy. Two of them are evaluated by means of simulation. For point-to-multipoint communication the new XOR selective repeat strategy can improve the throughput of existing systems remarkably. The idea of the XOR selective repeat strategy is to physically combine several blocks negatively acknowledged by different receivers by XORing them to minimize the number of retransmissions and hence to increase throughput. >