This thesis explores the queueing performance of a wireless communication system that transmits packets over a correlated erasure channel using the IEEE 802.11 protocol suit. The channel states and the queue length together form a Markov chain. Exploiting this mathematical structure, the probability of the queue exceeding a certain threshold can be obtained. Most previous contributions in this area treat code-rate selection, channel erasure probability and network congestion separately. In this thesis, a simple integrated approach, which jointly considers these factors, is introduced. This approach becomes especially valuable for capturing the performance of delay-sensitive communication systems over time-varying channels. This thesis starts with a review of related work about correlated bit-erasure wireless channel models. A numerical study is then conducted to demonstrate the importance of optimizing overall system performance, and how this process impacts error-control coding at the physical layer. Following this exercise, a packet-erasure channel model with a Poisson arrival process is analyzed. The Baum-Welch algorithm is subsequently presented as a means to estimate the parameters of wireless communication systems. Furthermore, a matrix geometric method for obtaining the stationary distribution of the ensuing Markov chain is discussed. This offers a new perspective on wireless communication in the context of delay-sensitive applications. To complement the analysis platform put forth in this work, illustrative numerical results are contained in the last section of the thesis. From these results, design guidelines for improving the performance of delay-sensitive wireless communication systems are established. Although these results are obtained under simplifying assumptions, the overall methodology applies to more general situations, especially for wide-band delay-sensitive wireless communication applications.

Wireless communication is facing an increasingly severe spectrum scarcity problem. Hybrid free space optical (FSO)/ millimetre wavelength (MMW) radio frequency (RF) systems and cognitive radios are two candidate solutions. Hybrid FSO/RF can achieve high data rate transmission for wireless back haul. Cognitive radio transceivers can opportunistically access the underutilized spectrum resource of existing systems for new wireless services. In this work we carry out accurate performance analysis on these two transmission techniques. In particular, we present and analyze a switching based transmission scheme for a hybrid FSO/RF system. Specifically, either the FSO or RF link will be active at a certain time instance, with the FSO link enjoying a higher priority. We consider both a single threshold case and a dual threshold case for FSO link operation. Analytical expressions are obtained for the outage probability, average bit error rate and ergodic capacity for the resulting system. We also investigate the delay performance of secondary cognitive transmission with interweave implementation. We first derive the exact statistics of the extended delivery time, that includes both transmission time and waiting time, for a fixed-size secondary packet. Both work-preserving strategy (i.e. interrupted packets will resume transmission from where interrupted) and non-work-preserving strategy (i.e. interrupted packets will be retransmitted) are considered with various sensing schemes. Finally, we consider a M/G/1 queue set-up at the secondary user and derive the closed-form expressions for the expected delay with Poisson traffic. The analytical results will greatly facilitate the design of the secondary system for particular target application. / Graduate

Numerous studies on Queueing systems, such as Internet traffic flows, have shown to be bursty, self-similar and/or long-range dependent, because of the heavy (long) tails for the various distributions of interest, including intermittent intervals and queue lengths. Other studies have addressed vacation in no-customers’ queueing system or when the server fails. These patterns are important for capacity planning, performance prediction, and optimization of networks and have a negative impact on their effective functioning. Heavy-tailed distributions have been commonly used by telecommunication engineers to create workloads for simulation studies, which, regrettably, may show peculiar queueing characteristics. To cost-effectively examine the impacts of different network patterns on heavy- tailed queues, new and reliable analytical approaches need to be developed. It is decided to establish a brand-new analytical framework based on optimizing entropy functionals, such as those of Shannon, Rényi, Tsallis, and others that have been suggested within statistical physics and information theory, subject to suitable linear and non-linear system constraints. In both discrete and continuous time domains, new heavy tail analytic performance distributions will be developed, with a focus on those exhibiting the power law behaviour seen in many Internet scenarios. The exposition of two major revolutionary approaches, namely the unification of information geometry and classical queueing systems and unifying information length theory with transient queueing systems. After conclusions, open problems arising from this thesis and limitations are introduced as future work.