Cross-layer performance control of wireless channels using active local profiles

To optimize performance of applications running over wireless channels state-of-the-art wireless access technologies incorporate a number of channel adaptation mechanisms. While these mechanisms are expected to operate jointly providing the best possible performance for current wireless channel and traffic conditions, their joint effect is often difficult to predict. To control functionality of various channel adaptation mechanisms a new cross-layer performance optimization system is sought. This system should be responsible for exchange of control information between different layers and further optimization of wireless channel performance. In this paper design of the cross-layer performance control system for wireless access technologies with dynamic adaptation of protocol parameters at different layers of the protocol stack is proposed. Functionalities of components of the system are isolated and described in detail. To determine the range of protocol parameters providing the best possible performance for a wide range of channel and arrival statistics the proposed system is analytically analyzed. Particularly, probability distribution functions of the number of lost frames and delay of a frame as functions of first- and second-order wireless channel and arrival statistics, automatic repeat request, forward error correction functionality, protocol data unit size at different layers are derived. Numerical examples illustrating performance of the whole system and its elements are provided. Obtained results demonstrate that the proposed system provide significant performance gains compared to static configuration of protocols

ARQ protocol for joint source and channel coding and its applications

Shannon\u27s separation theorem states that for transmission over noisy channels, approaching channel capacity is possible with the separation of source and channel coding. Practically, the situation is different. Infinite size blocks are needed to achieve this theoretical limit. Also, time-varying channels require a different approach. This leads to many approaches for source and channel coding. This dissertation will address a joint source and channel coding that suits Automatic Repeat Request (ARQ) application and applies it to packet switching networks. Following aspects of the proposed joint source and channel coding approach will be presented: The design of the proposed joint source and channel coding scheme. The approach is based on a variable length coding scheme which adapts the arithmetic coding process for joint source and channel coding. The protocol using this joint source and channel coding scheme in communication systems. The error recovery technique of the proposed scheme is presented. The application of the scheme and protocol. The design is applied to wireless TCP network and real-time video transmissions. The coding scheme embeds the redundancy needed for error detection in source coding stage. The self-synchronization property of lossless compression is utilized by decoder to detect channel errors. With this approach, error detection may be delayed. The delay in detection is referred to as error propagation distance. This work analyzes the distribution of error propagation distance. The error recovery technique of this joint source and channel coding for ARQ (JARQ) protocol is analyzed. Throughput is studied using signal flow graph for both independent channel and nonindependent channels. A packet combining technique is presented which utilizes the non-uniform distribution of error propagation distance to increase the throughput. The proposed scheme may be applied to many areas. In particular, two applications are discussed. A TCP/JARQ protocol stack is introduced and the coordination between TCP and JARQ layers is discussed to maximize system performance. By limiting the number of retransmission, the proposed scheme is applied to real-time transmission to meet timing requirement

Tiny Codes for Guaranteeable Delay

Future 5G systems will need to support ultra-reliable low-latency communications scenarios. From a latency-reliability viewpoint, it is inefficient to rely on average utility-based system design. Therefore, we introduce the notion of guaranteeable delay which is the average delay plus three standard deviations of the mean. We investigate the trade-off between guaranteeable delay and throughput for point-to-point wireless erasure links with unreliable and delayed feedback, by bringing together signal flow techniques to the area of coding. We use tiny codes, i.e. sliding window by coding with just 2 packets, and design three variations of selective-repeat ARQ protocols, by building on the baseline scheme, i.e. uncoded ARQ, developed by Ausavapattanakun and Nosratinia: (i) Hybrid ARQ with soft combining at the receiver; (ii) cumulative feedback-based ARQ without rate adaptation; and (iii) Coded ARQ with rate adaptation based on the cumulative feedback. Contrasting the performance of these protocols with uncoded ARQ, we demonstrate that HARQ performs only slightly better, cumulative feedback-based ARQ does not provide significant throughput while it has better average delay, and Coded ARQ can provide gains up to about 40% in terms of throughput. Coded ARQ also provides delay guarantees, and is robust to various challenges such as imperfect and delayed feedback, burst erasures, and round-trip time fluctuations. This feature may be preferable for meeting the strict end-to-end latency and reliability requirements of future use cases of ultra-reliable low-latency communications in 5G, such as mission-critical communications and industrial control for critical control messaging.Comment: to appear in IEEE JSAC Special Issue on URLLC in Wireless Network