Performance Evaluation of Polling Protocols for Data Transmission on Wireless Communication Networks

The growing interest in mobile computing and communication devices leads to the necessity of wireless broadband network. Data transmission over such networks requires suitable error control schemes to guarantee high data reliability as well as efficient bandwidth utilization.In this paper we propose an accurate yet simple analytical approach to evaluate the performance of wireless networks using gated and exhaustive polling protocols combined with the Stop and Wait (SW) or Go Back N (GBN) ARQ schemes [Bertsekas and Gallager, 2]. Moreover, simulation results concerning the performance of polling protocols combined with the Selective Repeat (SR) ARQ scheme are also shown for comparison purposes.Protocol performance is estimated under very general assumptions, such as: AWGN or fading channels, arbitrary value of the round trip delay and arbitrary distribution of the traffic load (i.e., both symmetric or asymmetric system have been considered).     

A preemptive polling protocol for applications in wireless LANs

This paper deals with a radio‐based communication network with a single radio channel shared by several data terminals for transmissions to a single hub station. In particular, the communication system considered is a potential provider of wireless LAN‐like services. The focus is on the capacity of combining a preemptive polling‐based multiple access scheme with a Selective Repeat ARQ technique to counteract the effect of the nonstationary transmission channel. The nonstationary transmission channel has been modeled as a two‐state Markov chain with parameters related to actual propagation conditions. Typical outdoor/indoor environments have been considered. The main idea is that of making the service interruption of the preemptive polling scheme dependent on the propagation conditions of the transmission channel by monitoring the outcome of the data packet transmission attempts. A performance comparison clearly reveals the superiority of this preemptive polling scheme with respect to the classical cyclic polling scheme. This revised version was published online in June 2006 with corrections to the Cover Date.     

Performance of combined ARQ with SR and GBN for broadband wirelesssystems on a 40 GHz band radio channel

Mobile wireless communication systems for the fourth generation are being explored. The key is broadband and high-quality communications to support multimedia services, and the use of millimeter or centimeter-wave band and ARQ is being considered to realize such communications. In this article we propose a new ARQ scheme which is combined with SR and GBN, and confirm that this new scheme is proper for broadband communication systems. We implemented our ARQ function with hardware and evaluated the ARQ performance: throughput, cell loss rate, and cell transfer delay on a pseudo Rayleigh fading channel. In addition, we evaluated ARQ performance on an actual 40 GHz band radio channel. Through the evaluation, we found it necessary to design an ARQ scheme in accordance with system requirements, and our combined ARQ satisfies this required condition     

Throughput Analysis for Parallel ARQ over Correlated MIMO Channels

We treat the throughput analyses of parallel ARQ schemes over correlated MIMO channels with adaptive modulation and coding (AMC). To describe the packet transmission over multiple parallel logic channels, we extend the existing burst- error model for single channel to multiple parallel logic channels. Based on such a packet error model, we derive the throughput of different parallel ARQ protocols. Moreover, to describe the temporally correlated physical channel fading, we generalize the existing Markov model for single channel to multiple parallel channels for MIMO systems. Then we develop a method for calculating the packet-level model parameters from the parameters of the physical-layer model and the MIMO transceiver. Using the above hierarchical throughput analysis framework, we investigate the potential throughput gain or throughput loss of parallel ARQ over the conventional serial ARQ in MIMO systems. Our results reveal that as SNR increases, parallel ARQ can achieve higher throughput gain or less throughput loss compared to serial ARQ; parallel SW can achieve throughput gain in most of the MIMO scenarios but increasing the number of antennas does not always bring higher gain; parallel GBN with large number of antennas and independent buffers can achieve throughput gain; parallel SR incurs throughput loss.     

Queuing analysis of the selective repeat automatic repeat requestprotocol wireless packet networks

This paper presents an analytical approach for analyzing the mean packet delay and mean queue length at the transmitting terminal in wireless packet networks using the selective repeat (SR) automatic repeat request (ARQ) scheme to control the errors introduced by the nonstationary transmission channel. Each transmitting terminal is modeled as a discrete time queue with an infinite buffer. The nonstationary transmission channel is modeled as a two-state Markov chain. Comparisons of numerical predictions and simulation results are presented to highlight the accuracy of the proposed analytical approach     

Frequency-hopped ARQ for wireless network data services

The throughput efficiency and probability of undetected error of automatic-repeat-request (ARQ) protocols employing slow frequency hopping over Gilbert-Elliott (1960, 1963) fading channels are investigated. Throughput efficiency formulas for the three basic ARQ schemes, “stop-and-wait” (SW), “go-back-N” (GBN), and “selective-repeat” (SR), are obtained, and the improvement in throughput efficiency due to slow frequency hopping is examined. Results are also presented on the problem of determining the number of carriers used for frequency hopping so as to minimize the effect of fading channel memory and, therefore, optimize system performance. This work has application to TDMA architectures and packet data services for third generation wireless networks, where projected data service requirements call for error rates on the order of 10^-9 , and the multiple service, multiple access environment demands that the delay for any service be minimized     

Performance evaluation of preemptive polling schemes and ARQtechniques for indoor wireless networks

This paper examines a radio-based indoor communication network with a single radio channel shared by several data terminals. By enabling the terminals to communicate with each other and access the resources of a wired network, the system is a potential provider of in-building LAN-like services. In this indoor fading environment, a base-station approach is assumed. In the analysis, a two-state Markov chain model is used to model the nonstationary transmission channel. Two preemptive polling multiple-access schemes combine with ARQ error-control schemes to counteract the effects of a nonstationary transmission channel. The main idea devised is that of making the service interruption dependent on the propagation conditions of the transmission channel by monitoring the outcomes of the data packet transmission attempts. A performance comparison reveals the superiority of the preemptive polling systems with respect to a classical TDMA scheme     

Throughput analysis of some ARQ protocols in the presence offeedback errors

Automatic-repeat-request (ARQ) protocols have been analyzed for quite some time, but the issue of errors in the feedback channel has not received much attention. In some applications, such as digital mobile communications, this issue can be important. Accordingly, this paper examines the effect of feedback errors on the throughputs of the stop-and-wait (SW), go-back-N (GBN), and selective repeat (SR) ARQ protocols for the ease of a point-to-point channel under some feedback information assumptions. It is shown that the deleterious effects of feedback errors on the throughputs of continuous (e.g., GBN and SR) ARQ protocols can be greatly reduced by a simple modification in the retransmission operation, provided that the “complete state” of the receiver is sent back with each acknowledgment     

On the Analysis of the Bluetooth Time Division Duplex Mechanism

Efficient communication in Bluetooth networks requires design of intra and inter-piconet scheduling algorithms, and therefore, numerous algorithms have been proposed. However, due to complexities of the Bluetooth MAC, the performance of these algorithms has been analyzed mostly via simulation. We present analytic results regarding the exhaustive, gated, and limited (pure round robin) scheduling algorithms in piconets with bidirectional and unidirectional traffic. We show that a piconet operated according to the limited scheduling algorithm is equivalent to a 1-limited polling system and present exact results regarding symmetric piconets with bidirectional traffic. Then, the difficulties in analyzing the performance of the exhaustive and gated algorithms in a piconet with bidirectional traffic are demonstrated. In addition, we present exact analytic results for piconets with unidirectional traffic. We show that, surprisingly, in symmetrical piconets with only uplink traffic, the mean waiting time is the same for the exhaustive and limited algorithms. This observation results from the differences between piconets and traditional polling systems and can be extended for time-division-duplex systems with arbitrary packet lengths. Furthermore, we show that the mean waiting time in a piconet with only uplink traffic is significantly higher than its corresponding value in a piconet with only downlink traffic. Finally, we numerically compare the exact results to approximate results, presented in the past.     

Multiplexed ARQ for time-varying channels. II. Postponedretransmission modification and numerical results

For pt.I see ibid., vol.46, no.1, p.41-51, 1998. A “postponed retransmission” (PR) modification to both go-back-N (GBN) and ideal selective repeat (ISR) automatic-repeat-request (ARQ) is discussed and analyzed. A scheme for reducing the number of states involved in the calculation for multiplexed GBN ARQ is also presented. Numerical results are then shown for stop-and-wait (SW), GBN, and selective repeat (SR) ARQ (as well as the PR modified versions), under both round-robin and adaptive multiplexing     

慢瑞利衰落信道下一种变分组长度的自适应ARQ协议

信道的慢瑞利衰落特性导致通信系统的性能——吞吐量的下降。本文基于选择重传(SRARQ)与返回-n(GBN ARQ)相结合的混合ARQ协议(SR GBN ARQ),依据发送方连续收到的确认(ACK)/非确认(NACK)消息的次数,正确评估慢瑞利衰落信道的状况以改变分组长度的一种自适应ARQ协议。仿真结果表明对于慢瑞利衰落、长往返旅程延迟(T)信道,该协议能取得较优的吞吐性能。     

Performance of H.263 video transmission over wireless channelsusing hybrid ARQ

This paper proposes a hybrid ARQ error control scheme based on the concatenation of a Reed-Solomon (RS) code and a rate compatible punctured convolutional (RCPC) code for low-bit-rate video transmission over wireless channels. The concatenated hybrid ARQ scheme we propose combines the advantages of both type-I and type-II hybrid ARQ schemes. Certain error correction capability is provided in each (re)transmitted packet, and the information can be recovered from each transmission or retransmission alone if the errors are within the error correction capability (similar to type-I hybrid ARQ). The retransmitted packet contains redundancy bits which, when combined with the previous transmission, result in a more powerful RS/convolutional concatenated code to recover information if error correction fails for the individual transmissions (similar to type-II hybrid ARQ). Bit-error rate (BER) or signal-to-noise ratio (SNR) of a radio channel changes over time due to mobile movement and fading. The channel quality at any instant depends on the previous channel conditions. For the accurate analysis of the performance of the hybrid ARQ scheme, we use a multistate Markov chain (MSMC) to model the radio channel at the data packet level. We propose a method to partition the range of the received SNR into a set of states for constructing the model so that the difference between the error rate of the real radio channel and that of the MSMC model is minimized. Based on the model, we analyze the performance of the concatenated hybrid ARQ scheme. The results give valuable insight into the effects of the error protection capability in each packet, the mobile speed, and the number of retransmissions. Finally, the transmission of H.263 coded video over a wireless channel with error protection provided by the concatenated hybrid ARQ scheme is studied by means of simulations     

Performance of hybrid ARQ for IP packet transmission on fadingchannel

This paper proposes and analyzes the performance of a hybrid selective repeat (SR)/multicopy (MC) automatic repeat request (ARQ) scheme to transmit fragmented Internet protocol (IP) packets. The ARQ scheme works in the SR mode until the last IP packet fragment is transmitted. If a fragment is negatively acknowledged after the last fragment is transmitted, then the system goes in the MC mode. In the MC mode, multiple copies of the erroneous fragment are transmitted. After all IP fragments are received without error, the system goes back to the SR mode. The performance of the proposed scheme is evaluated in terms of the bit error rate (BER), IP packet size, and fragmentation size with and without Bose Chaudhuri Hocquenghem (BCH) error correction codes. Both the results are obtained under additive white Gaussian noise (AWGN) as well as flat Rayleigh fading channels. The proposed scheme gives a throughput of 0.9, even at high BER conditions, for any IP packet size under an AWGN channel while, an 8-dB improvement is achieved, when using BCH(63, 51, 2) for throughput of 0.9, over selective repeat+stutter scheme 2 (SR+ST 2) under a flat Rayleigh fading channel     

Packet level acknowledgement and Go‐Back‐N protocol performance in infrared wireless LANs

Infrared wireless LANs may employ repetition rate (RR) coding to increase the symbol capture probability at the receiver. This paper examines the effectiveness of RR coding to utilization for infrared LANs using the physical and link layer parameter values proposed in the Advanced Infrared (AIr) protocol standard, which is developed by the Infrared Data Association (IrDA). Infrared LANs employ a Go‐Back‐N (GBN) automatic repeat request (ARQ) retransmission scheme at the Link Control (LC) layer to ensure reliable information transfer. To efficiently implement RR coding, the receiver may return after every DATA packet a suggestion for the suitable RR value to be used by the transmitter and implement a Stop‐and‐Wait (SW) ARQ scheme at the medium access control (MAC) layer. The effectiveness of employing this optional SW ARQ scheme at the MAC layer is discussed. Analytical models for the ARQ retransmission schemes are developed and employed to compare protocol utilization for different link parameter values such as window size, packet length and LC time out periods. This analysis identifies the ARQ protocol that maximizes performance for the specific link quality and the implemented link layer parameters. The effectiveness of the proposed RR coding to LAN utilization for different ARQ scheme implementation is finally explored. This analysis identifies the link quality level at which RR should be adjusted for maximum performance. It is concluded that if the packet error rate is higher than 0.1–0.4 (depending on the implemented ARQ protocol), the receiver should advise the transmitter to double the implemented RR for maximum performance. These error rate values are high and can be effectively estimated by the transmitter based on packet retransmissions. Thus, the usefulness of the receiver indicating to the transmitter to adjust RR is questionable, as the transmitter can effectively implement the suitable RR value based on packet retransmissions. Copyright © 2003 John Wiley & Sons, Ltd.     

Improved polling-based multiple access protocol for packet voicetransmission

A novel multiple access protocol suitable for packet voice transmission over TDMA-based wireless networks is introduced. The protocol, called the polling assisted by reservations (PAR), is a combination of cyclic polling with random access. Simulation results are provided demonstrating that the PAR protocol offers a significant performance improvement over cyclic polling schemes     

A Novel Three-State ARQ Scheme for Variable Error-Tate Channels

This paper presents a new type of automatic-repeat-request (ARQ) scheme, Three-State ARQ (TS-ARQ), for error control in data transmission over a noisy channel. The new scheme is based on the Go-Back-N (GBN) protocol and uses three different methods of GBN protocols: basic GBN, n-copy GBN and continuous-GBN. The new ARQ model is applicable for channels having the variable noise level going from low through medium until very high levels. As it is known, such wireless channels are to be found in terrestrial and space (satellite) communications. This model is to be used for the estimation of the noise state in the channel and one of the methods is used, depending of the noise level. When the noise level is low GBN-ARQ is used, in the case of the medium noise level the n-copy GBN is used, and if the noise level is high continuous-GBN will be applied. This paper presents the method of determining the parameters and transfer moments from one state to another. An original mathematical model is given, together with evaluation results. These results are compared with the known methods and the conclusion that the described method provides some better performances is drowned. The implementation of this new procedure is simple as described in the flow chart given in the paper.     

Analysis of an identifier splitting algorithm combined with polling(ISAP) for contention resolution in a wireless access network

A contention resolution scheme for an uplink contention channel in a wireless access network is presented. The scheme consists of a tree algorithm, namely the identifier splitting algorithm (ISA), combined with a polling scheme. Initially, ISA is used, but at a certain level of the tree, the scheme switches to polling of the stations. This scheme is further enhanced by skipping a few levels in the tree when starting the algorithm (both in a static and a dynamic way) and by allowing multiple instants simultaneously. An analytical model of the system and its variants leads to the evaluation of its performance, by means of the delay density function and the throughput characteristics. This model is used to investigate the influence of the packet arrival rate, the instant at which the ISA scheme switches to polling, the starting level of the ISA scheme, and the use of multiple instances on the mean delay, the delay quantiles, and the throughput     

Analysis and optimization of adaptive multicopy transmission ARQprotocols for time-varying channels

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     

Comparison of two ARQ protocols in a Rayleigh fading channel

Go-back-N (GBN) and selective repeat (SR) protocols for automatic repeat request (ARQ) are compared in a frequency-nonselective Rayleigh fading channel. Protocols implemented in software are used in a computer-simulated fading channel to study the throughput of these protocols as a function of fading parameters, such as the mean signal-to-noise ratio (SNR), maximum Doppler frequency number of diversity branches, time-out period and round-trip delay. The purpose is to complement well-documented theoretical work in (1) providing some design considerations and (2) investigating quantitatively whether data communications combining detection-only coding, diversity, and basic ARQ protocols can offer reasonable throughput in a fading channel. Although based on a set of assumptions, the following conclusions remain valid: (1) SR is significantly superior to GBN when the fading rate is high; this advantage decreases as fading becomes slower; and (2) error detection combined with ARQ and diversity selection can provide reliable data communications in a Rayleigh fading channel