It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
The quality of service (QoS) experienced by traffic streams in a wireless link is closely related to the dynamics of the wireless channel. Hence, many recent studies have considered cross-layer interaction between the physical layer and the scheduling layer in the wireless system. These studies typically use simplistic channel models like first-order Markov models to represent the wireless channel. Since the higher-layer building blocks are variants of Markov processes, these channel models match the higher-layer setup and simplify cross-layer analysis and optimization. However, first-order Markov models cannot adequately model even simple wireless channel scenarios and thus can lead to erroneous QoS predictions.
This thesis begins by introducing hidden Markov models (HMM) to model the wireless channel behavior in QoS analysis contexts. HMM random processes are general enough to model wireless channel processes adequately. The structure of HMM processes permits the development of exact and approximate methods to analyze QoS performance. Then, a low-complexity approximate QoS analysis technique based on “burstiness” properties of the channel random process is developed. The complexity reduction is achieved by functional mapping of the random process using peakedness functional. A closed form analytic expression is derived for computing the peakedness functional from the HMM parameters of the process. Then, HMM-based channel models are used to formulate a general framework for exact QoS analysis and QoS-constrained cross-layer optimization. An efficient solution technique based on linear programming (LP) techniques is developed to solve this formulation. Further, a lower bound and upper bound for the optimal scheduling problem are developed as LP formulations. To conclude the thesis, the matrix-geometric method is used to provide an alternate QoS analysis technique for a special case of wireless channels.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer