Adaptive Modulation and Coding with Selective Retransmission under OFDM signaling

In this paper, we present bandwidth efficient selective retransmission method in conjunction with adaptive modulation and coding (AMC) scheme for OFDM waveform. In the proposed method, when a packet failure occurs, receiver requests retransmission of information symbols prone to error corresponding to the low signal-to-noise ratio (SNR) sub-carriers of OFDM modulation. The selective retransmission avoids unnecessary retransmission and AMC chooses a proper modulation and coding scheme with an objective to maximize the throughput. Our method achieves higher throughput as compared to conventional retransmission methods such as Chase combining hybrid automatic repeat reQuest (CC-HARQ) and incremental redundancy hybrid automatic repeat reQuest (IR-HARQ). We also provide the throughput and delay analysis of the proposed method for non-truncated ARQ. The simulation results demonstrate throughput gain without significant impact on delay as compared to the conventional retransmission approaches.     

Dynamically reducing retransmission control forslow-frequency-hopped communication systems

A dynamically reducing retransmission control scheme is proposed for slow-frequency-hopped communication systems. In the proposed scheme a transmitter defers transmission of a new packet until all the other transmitters receive positive acknowledgments, so that the number of active transmitters are dynamically reduced. The performance of the proposed scheme is compared with the conventional scheme, in which a transmitter is permitted to transmit a new packet in any slot, in terms of the normalized throughput and the 98% packet transmission delay. The numerical results show that the proposed scheme outperforms the conventional scheme, although for some values of the number of transmitters the conventional scheme has higher normalized throughput     

An adaptive opportunistic retransmission control scheme environment-aware-based for wireless multimedia Mesh networks

In this paper, we propose an aware-based adaptive opportunistic retransmission control scheme for wireless multimedia Mesh networks. The proposed scheme provides maximum retransmission count optimization based on environment-aware to improve packet relay probability. The scheme discriminates the types of packet loss in wireless link by means of environment information and selects the retransmission count by taking the IEEE 802.11 wireless channel characteristics into consideration. Furthermore, the maximum retransmission count of MAC is adjusted adaptively. Extensive simulations demonstrate that the proposed scheme significantly reduces packet collision probability and packet loss rate, and thus improves network throughput.     

A Real Time Transport Scheme for Wireless Multimedia Communications

In wireless communications systems, a mobile station is typically equipped with limited processing capability and buffer space for transmitting and receiving. The radio link is usually found to be noisy and its propagation delay is sometimes non-negligible as compared with the packet transmission delay. And because of the necessity of flow control and packet retransmission upon error, the delay and throughput performance cannot satisfy the need of a particular traffic type, i.e., real-time multimedia. This paper presents a scheme suitable for the above condition, called the Burst-oriented Transfer with Time-bounded Retransmission (BTTR). The present scheme uses a large transmission window for sending/receiving a burst of time-sensitive data and, within this window, another smaller observation window is repeatedly used for error status feedback via the backward channel. There is time limitation on each retransmission such that the burst of data can be received in a timely manner, however, with some degradation on the packet loss rate. An analysis is given in terms of the expectations of delay, throughput, and packet drop rate. A comparison with an error-free link protocol will also be given. The result shows that the proposed scheme can meet the delay and throughput requirement under reasonable packet drop rate.     

Performance enhancement of mSCTP for vertical handover across heterogeneous wireless networks

In the mobile Stream Control Transmission Protocol (mSCTP) for vertical handover, a mobile user may suffer from performance degradation due to the problems of packet reordering and retransmission timeout and due to the packet loss during handover. To solve these problems, we propose a new scheme of handover retransmission for mSCTP handover, in which the correspondent node retransmits the outstanding data packets to the mobile node over the new primary path. From simulation results, it is shown that the proposed scheme can avoid the packet reordering and retransmission timeout problems during handover. Moreover, we can see that the proposed scheme can significantly improve throughput of mSCTP handover, compared with the existing schemes. Copyright © 2009 John Wiley & Sons, Ltd.     

Performance of a type-II hybrid ARQ protocol in slotted DS-SSMApacket radio systems

The application of a type-II hybrid ARQ protocol in a slotted direct-sequence spread-spectrum multiple-access (DS-SSMA) packet radio system is investigated. Both the static performance and the dynamic performance of such a system are analyzed. In the physical layer, packet error and packet success probabilities are computed using the improved Gaussian approximation technique, which accounts for the bit-to-bit error dependence within a packet. In the data-link layer, two-dimensional Markov chains are employed to model the system dynamics. Based on this model, the performance of the type-II hybrid ARQ protocol is upper and lower bounded by considering, respectively, a superior scheme and an inferior scheme. Steady state throughput and delay performances of the two bounding schemes are obtained. Moreover, it is shown that for each fixed input load, there is an optimal retransmission probability under the finite user population assumption. Bounds on this optimal retransmission probability are also given     

The performance of type-I trellis coded hybrid-ARQ protocols overAWGN and slowly fading channels

A method is described for modifying trellis coded modulation systems for use in type-1 hybrid-ARQ protocols. The difference between the partial path metric of the survivor and that of the best nonsurvivor at each node in the trellis is used to determine the desirability of a retransmission request for a given received packet. Bounds on the reliability and throughput performance of the resulting error control scheme are derived for AWGN channels and slowly fading Rician channels. Examples are included to illustrate the achievable gain of the proposed system relative to ordinary forward-error-correcting trellis coded systems. Hybrid-ARQ protocols based on ordinary trellis coded modulation and multiple trellis coded modulation are also compared over slowly fading Rician channels. The dependence of performance on packet length is examined and illustrated by examples. All analytical results are supported by data from a series of simulations     

Evaluation of the effects of protocol processing overhead in errorrecovery schemes for a high-speed packet switched network: link-by-linkversus edge-to-edge schemes

The authors investigate the effects of protocol processing overhead on the performance of error recovery schemes. The focus is on the edge-to-edge error recovery scheme, in which retransmissions of erred packets only take place between source and destination nodes. An approximation is obtained for the Laplace transform for the distribution of the end-to-end packet transfer delay, considering the processing time required for error recovery. The performance of the link-by-link error recovery scheme, in which retransmissions take place between adjacent nodes, is evaluated and compared to the performance of the edge-to-edge scheme. Numerical results from a tandem queuing network model show that for a network with very-high-speed/low-error-rate channels, an edge-to-edge scheme gives a smaller packet transmission delay than a link-by-link scheme for both go-back-N and selective-repeat retransmission procedures, while keeping the packet loss probability sufficiently small     

Throughput maximization of ad-hoc wireless networks using adaptive cooperative diversity and truncated ARQ

We propose a cross-layer design which combines truncated ARQ at the link layer and cooperative diversity at the physical layer. In this scheme, both the source node and the relay nodes utilize an orthogonal space-time block code for packet retransmission. In contrast to previous cooperative diversity protocols, here cooperative diversity is invoked only if the destination node receives an erroneous packet from the source node. In addition, the relay nodes are not fixed and are selected according to the channel conditions using CRC. It will be shown that this combination of adaptive cooperative diversity and truncated ARQ can greatly improve the system throughput compared to the conventional truncated ARQ scheme and fixed cooperative diversity protocols. We further maximize the throughput by optimizing the packet length and modulation level and will show that substantial gains can be achieved by this joint optimization. Since both the packet length and modulation level are usually discrete in practice, a computationally efficient algorithm is further proposed to obtain the discrete optimal packet length and modulation level.     

Cross-layered retransmission schemes for TCP-based services

Various retransmission schemes for wireless communication systems have been used to improve performance such as reliability and throughput. Each retransmission scheme is designed to improve the performance according to characteristics of each layer of protocol stacks, such as delay components and error control. Especially, a cross-layered retransmission scheme has been proposed to maximize the spectral efficiency by combining a retransmission scheme and adaptive modulation and coding (AMC). However, the cross-layered retransmission scheme is designed for performance improvement at the wireless access networks. The end-to-end performance is not taken into account for modeling of the cross-layered retransmission schemes. It is difficult to design retransmission schemes for the end-to-end performance improvement. In this paper, we analyze the delay and the throughput at the transport layer for the end-to-end performance when a system uses a cross-layered retransmission scheme and the transmission control protocol as the reliable transmission protocols. We also propose a cross-layered retransmission strategy, AMC combined with automatic repeat request (ARQ) and hybrid ARQ (HARQ), to improve end-to-end throughput. From the evaluation results, it is shown that the proposed cross-layered retransmission strategy is suitable for delay insensitive services that require high throughput.     

Sequential decoding with an efficient partial retransmission ARQstrategy

The authors present and analyze an efficient partial retransmission automatic repeat request (ARQ) strategy using convolutional coding and sequential decoding in conjunction with code combining. In the proposed ARQ scheme, whenever a packet of data needs to be retransmitted that packet is not repeated entirely as in the case of conventional full retransmission ARQ strategies. Instead, symbols of that packet are repeated a few at a time, sequentially, as needed, hence making a more effective use of the channel. It is shown that partial repetitions and code combining still yields an increase of the apparent Pareto exponent of sequential decoding, as in the case of full repetition-code combining. A throughput analysis shows that the partial retransmission ARQ strategy yields a substantial throughput improvement over the full retransmission-code combining ARQ strategies     

Optimized Congestion Management Protocol for Healthcare Wireless Sensor Networks

The application of Wireless Sensor Networks (WSNs) in healthcare is dominant and fast growing. In healthcare WSN applications (HWSNs) such as medical emergencies, the network may encounter an unpredictable load which leads to congestion. Congestion problem which is common in any data network including WSN, leads to packet loss, increasing end-to-end delay and excessive energy consumption due to retransmission. In modern wireless biomedical sensor networks, increasing these two parameters for the packets that carry EKG signals may even result in the death of the patient. Furthermore, when congestion occurs, because of the packet loss, packet retransmission increases accordingly. The retransmission directly affects the lifetime of the nodes. In this paper, an Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary. This protocol consists of two stages. In the first stage, a novel Active Queue Management (AQM) scheme is proposed to avoid congestion and provide quality of service (QoS). This scheme uses separate virtual queues on a single physical queue to store the input packets from each child node based on importance and priority of the source’s traffic. If the incoming packet is accepted, in the second stage, three mechanisms are used to control congestion. The proposed protocol detects congestion by a three-state machine and virtual queue status; it adjusts the child’s sending rate by an optimization function. We compare our proposed protocol with CCF, PCCP and backpressure algorithms using the OPNET simulator. Simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.     

A novel random wireless packet multiple access method using CDMA

Random packet CDMA, a novel packet-based multiple access scheme for connectionless, uncoordinated random channel access is proposed. Random packet CDMA, or RP-CDMA, utilizes a novel packet format which consists of a short header and a data portion. Each header is spread with a unique spreading code which is identical for all users and packets, while the data portion of each packet is spread by a randomly chosen spreading sequence. The receiver operates in two stages: header detection and data detection. For header detection a conventional spread spectrum receiver is sufficient. Headers are spread with a large enough processing gain to allow detection even in severe interference. The data portion is decoded with a sophisticated receiver, such as a multiuser detector, which allows for successful decoding of overlapping active packets. It is shown that the RP-CDMA system is detector capability limited and that it can significantly outperform spread ALOHA systems whose performance is limited by the channel collision mechanism. RP-CDMA also experiences a much smaller packet retransmission rate than conventional or spread ALOHA, and provides better spectral efficiencies.     

Ad hoc网络基于协同的可靠组播丢失恢复算法设计

在Ad hoc网络中保证组播通信的可靠性要面对Ad hoc网络高误码率、带宽受限、节点能量有限和拓扑结构频繁变化等技术挑战。该文将协同的思想引入到组播丢失恢复设计中,设计了新的基于协同的可靠组播丢失恢复算法(CoreRM)。根据各个节点经历的不同丢失情况,通过自适应选择本地恢复、全局恢复或发送端恢复,分布式地处理整个网络的丢失恢复。CoreRM还设计了恢复路径缓存、NAK抑制机制,以及源路由数据包(SPM)发送机制来应对Ad hoc网络中的拓扑变化。性能分析和NS2的仿真实验表明相对于UDP和PGM可靠组播通信,CoreRM算法可以在网络吞吐量和丢失恢复延时方面有显著性能改善。     

Efficient stop-and-wait type II hybrid ARQ scheme

An efficient stop-and-wait ARQ protocol proposed by Sastry (1975) is modified to include a parity retransmission type II hybrid ARQ scheme. Unlike the Sastry scheme in which simple repeats of a data packet are transmitted, with the type II hybrid ARQ scheme, the data packet to be transmitted is encoded with a rate 1/2 code, and repetitions alternate between the two sequences obtained at the output of the encoder. It is found that the throughput can be substantially increased.<>     

中继协作无线网络中不完美反馈下基于网络编码的重传方案

无线广播网络传输过程中,目的节点反馈信息丢失或部分丢失导致发送节点不能了解目的节点的真实接收状态.为提高不完美反馈下无线网络的重传效率,本文提出中继协作无线网络中不完美反馈下基于网络编码的重传方案.本方案基于部分可观察马尔科夫决策过程对不完美反馈下的重传过程进行建模.发送节点根据系统观测状态和最大置信度更新系统估计状态,根据数据包发送顺序,优先选择最早丢失且能够恢复最多丢包的编码包重传.目的节点缓存不可解编码包以提升编解码机会.重传过程中源节点关注目的节点请求包需求,相同情况优先选择传输可靠性较高的中继节点,以提升传输有效性.仿真结果表明,在不完美反馈下相对于传统方案,本方案可有效提高重传效率.     

基于非均匀星座的改进ARQ方案及其性能分析

本文针对调制阶数大于4的MPSK和MQAM调制，在重传中采用非均匀星座图和符号比特重新排序，提出了一种改进的ARQ方案。通过对AWGN信道下ARQ方案进行理论分析和数值仿真，表明基于非均匀星座的新方案在信道条件较差时能有效地提高重要比特的可靠性，若重传中结合符号比特重排和分组合并，则可使接收端解调合并后的比特可靠性趋于均匀且总体得到提高，从而有效地减少重传次数，提高系统的吞吐率。由于本文所提方案并不改变调制解调规则和数据分组长度，故容易实现和控制。     

A Soft Combining Hybrid-ARQ Technique Applied to Throughput Maximization Within 3G Satellite IP Networks

This paper deals with the application of Hybrid-Automatic-Repeat-reQuest (H-ARQ) techniques to reliable end-to-end data communications in satellite networks, whose applications have to cope with accurate Quality-of-Service (QoS) requirements. Particularly, we face this problem by introducing a modified H-ARQ scheme based on the use of the turbo codes' error-correction capabilities. According to our scheme, each packet is turbo coded, and packet retransmissions are lowered by keeping track of previous erroneous packet-decoding results. Moreover, two kinds of these techniques are proposed and applied, respectively, to consecutive received packet replicas or to decoding algorithm outputs. The benefits achieved through this approach have a positive effect both on the error-recovery strategies and, above all, on the congestion-control protocols, since they rely on a retransmission scheme. By means of analytical derivations carried out under the assumption of a wideband-code-division multiple-access communications, it has been possible to highlight noticeable performance improvements in terms of bit- and frame-error rates and link throughput. Computer simulations performed focusing on a typical satellite-universal-mobile-telecommunication-system environment validate analytical predictions and point out a remarkable gain without requiring a significant hardware-complexity increase. As a result, it has been possible to allow active users a better QoS, in terms of error rate, throughput, and delivery delay, or to increase access-network capacity, besides avoiding transmitted-power wasting     

Adaptive Retransmission Diversity with Packet Combining for Slotted DS/CDMA Packet Radio Networks

A time diversity automatic repeat-request (ARQ) scheme is investigated for slotted random access direct-sequence code-division multiaccess (DS/CDMA ALOHA) wireless packet radio networks on multipath Rayleigh fading channels. The receiver retains and processes all the retransmissions of a single data block (packet) using predetection diversity combining, instead of discarding those which are detected in error. This effectively improves the system throughput and delay characteristics especially at small values of signal-to-noise ratio (SNR) per bit. A simple and practical selection combining rule is proposed, which lends itself to a low-complexity receiver structure and specifically suitable for high data rate transmissions. Owing to the stochastic nature of the multiple access interference, the new maximum output selection diversity (MO/SD) system yields superior performance in comparison to the traditional maximum SNR selection diversity (SNR/SD) model. The bit error rate performance, throughput and the average number of transmissions required to transmit a packet successfully with and without forward error correction (FEC) are evaluated. Numerical results reveal that the proposed adaptive retransmission diversity with packet combining provides a considerable advantage over the conventional slotted DS/CDMA ALOHA without incurring a substantial penalty in terms of cost or complexity.     

On Broadcast Stability of Queue-Based Dynamic Network Coding Over Erasure Channels

The transmission of packets is considered from one source to multiple receivers over single-hop erasure channels. The objective is to evaluate the stability properties of different transmission schemes with and without network coding. First, the throughput limitation of retransmission schemes is discussed and the stability benefits are shown for randomly coded transmissions, which, however, need not optimize the stable throughput for finite coding field size and finite packet block size. Next, a dynamic scheme is introduced for distributing packets among virtual queues depending on the channel feedback and performing linear network coding based on the instantaneous queue contents. The difference of the maximum stable throughput from the min-cut rate is bounded as function of the order of erasure probabilities depending on the complexity allowed for network coding and queue management. This queue-based network coding scheme can asymptotically optimize the stable throughput to the max-flow min-cut bound, as the erasure probabilities go to zero. This is realized for a finite coding field size without accumulating packet blocks at the source to start network coding. The comparison of random and queue-based dynamic network coding with plain retransmissions opens up new questions regarding the tradeoffs of stable throughput, packet delay, overhead, and complexity.