First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory

This article considers the performance of digital communication systems transmitting messages over finite-state erasure channels with memory. Information bits are protected from channel erasures using error-correcting codes; successful receptions of codewords are acknowledged at the source through instantaneous feedback. The primary focus of this research is on delay-sensitive applications, codes with finite block lengths and, necessarily, non-vanishing probabilities of decoding failure. The contribution of this article is twofold. A methodology to compute the distribution of the time required to empty a buffer is introduced. Based on this distribution, the mean hitting time to an empty queue and delay-violation probabilities for specific thresholds can be computed explicitly. The proposed techniques apply to situations where the transmit buffer contains a predetermined number of information bits at the onset of the data transfer. Furthermore, as additional performance criteria, large deviation principles are obtained for the empirical mean service time and the average packet-transmission time associated with the communication process. This rigorous framework yields a pragmatic methodology to select code rate and block length for the communication unit as functions of the service requirements. Examples motivated by practical systems are provided to further illustrate the applicability of these techniques.Comment: To appear in IEEE Transactions on Information Theor

802.11 Markov Channel Modelling

In order to understand the behavior of upper layer protocols and to design or fine tune their parameters over wireless networks, it is common to assume that the underlying channel is a flat Rayleigh fading channel. Such channels are commonly modeled as finite state Markov chains. Recently, hidden Markov models have also been employed to characterize these channels. Although Markov models have been widely used to study the performance of communications protocols at the link and transport layers, no validation of their accuracy has been performed against experimental data. These models are not applicable to frequency selective fading channels. Moreover, there are no good models to consider the effects of path loss (average received SNR), the packet size, and transmission rate variations which are significant in IEEE 802.11 wireless local area networks. This research performs validation of Markov models with experimental data and discusses the limitations of the process. In this dissertation, we present different models that have been proposed along with their validity analysis. We use the experimental data with stochastic modeling approaches to characterize the frame losses in IEEE 802.11 wireless LANs. We also characterize the important factor of current wireless LAN technology, the transmission rate variations. New guidelines for the construction of Markov and hidden Markov models for wireless LAN channels are developed and presented along the necessary data to implement them in performance studies. Furthermore we also evaluate the validity of using Markovian models to understand the effects on upper layer protocols such as TCP

Optimum hybrid error correction scheme under strict delay constraints

In packet-based wireless networks, media-based services often require a multicast-enabled transport that guarantees quasi error free transmission under strict delay constraints. Furthermore, both multicast and delay constraints deeply influence the architecture of erasure error recovery (EER). Therefore, we propose a general architecture of EER and study its optimization in this thesis. The architecture integrates overall existing important EER techniques: Automatic Repeat Request, Forward Error Correction and Hybrid ARQ techniques. Each of these EER techniques can be viewed as a special case of Hybrid Error Correction (HEC) schemes. Since the Gilbert-Elliott (GE) erasure error model has been proven to be valid for a wide range of packet based wireless networks, in this thesis, we present the general architecture and its optimization based on the GE channel model. The optimization target is to satisfy a certain target packet loss level under strict delay constraints efficiently. Through the optimization for a given real-time multicast scenario, the total needed redundancy information can be minimized by choosing the best HEC scheme automatically among the entire schemes included in the architecture. As a result, the performance of the optimum HEC scheme can approach the Shannon limit as closely as possible dynamically according to current channel state information.In Paket-basierten drahtlosen Netzwerken benötigen Medien-basierte Dienste oft Multicast-fähigen Transport, der quasi-fehlerfreie Übertragung unter strikten Zeitgrenzen garantiert. Außerdem beeinflussen sowohl Multicast als auch Zeitbegrenzungen stark die Architektur von Auslöschungs-Fehlerschutz (Erasure Error Recovery, EER). Daher stellen wir eine allgemeine Architektur der EER vor und untersuchen ihre Optimierung in dieser Arbeit. Die Architektur integriert alle wichtigen EER-Techniken: Automatic Repeat Request, Forward Error Correction und Hybrid ARQ. Jede dieser EER-Techniken kann als Spezialfall der Hybrid Error Correction (HEC) angesehen werden. Da das Gilbert-Elliot (GE) Auslöschungs-Fehler-Modell für einen weiten Bereich von Paket-basierten drahtlosen Netzwerken als gültig erwiesen wurde, präsentieren wir in dieser Arbeit die allgemeine Architektur und deren Optimierung basierend auf dem GE Kanalmodell. Zweck der Optimierung ist es, eine gewisse Ziel-Paketfehlerrate unter strikten Zeitgrenzen effizient zu erreichen. Durch die Optimierung für ein gegebenes Echtzeit-Mutlicast-Szenario kann die insgesamt benötigte Redundanz-Information minimiert werden. Dies erfolgt durch automatische Auswahl des optimalen HEC Schemas unter all den Schemata, die in die Architektur integriert sind. Das optimale HEC-Schema kann die Shannon Grenze so nahe wie möglich, dynamisch, entsprechend dem derzeitigen Kanalzustand, erreichen