Abstract not available

<p>This thesis o ers some prototypes to provide browser-based and mobile video communication services for Deaf people and evaluates these prototypes. The aim of this research is to identify an acceptable video communication technology for Deaf people by designing and evaluating several prototypes. The goal is to nd one that Deaf people would like to use in their day-to-day life. The thesis focuses on two technologies | browser-based systems and mobile applications. Several challenges emerged, for example, speci c Deaf user requirements are di cult to obtain, the technical details must be hidden from end users, and evaluation of prototypes includes both technical and social aspects. This thesis describes work to provide South African Sign Language communication for Deaf users in a disadvantaged Deaf community in Cape Town. We posit an experimental design to evaluate browser-based and mobile technologies in order to learn what constitutes acceptable video communication for Deaf users. Two browser-based prototypes and two mobile prototypes were built to this e ect. Both qualitative data and quantitative data are collected with user tests to evaluate the prototypes. The video quality of Android satis es Deaf people, and the portable asynchronous communication is convenient for Deaf users. The server performance is low on bandwidth, and will therefore cost less than other alternatives, although Deaf people feel the handset is costly.</p>

An architectural framework is proposed to secure the data link layer (Layer 2) in Internet protocol (IP) over Ethernet networks. In this architecture, a new security inter-layering concept, incorporating cryptographic Layer 2 identities, is introduced. Instead of traditional media access control (MAC) addresses, secure and flexible data link layer identifiers are utilized to securely bind Layer 2 and upper layers. In addition, to create security parameters and negotiate identifiers at the data link layer, a key establishment protocol is presented. Moreover, this architecture incorporates the IEEE 802.1AE standard (MACsec) and uses a key hierarchy similar to the IEEE 802.11i standard for future compatibility of wired and wireless networks. Finally, we provide a security analysis of the new data link layer security architecture.

An analytical framework is developed for distributed management of large networks where each node makes locally its decisions. Two issues remain open. One is whether a distributed algorithm would result in a near-optimal management. The other is the complexity, i.e., whether a distributed algorithm would scale gracefully with a network size. We study these issues through modeling, approximation, and randomized distributed algorithms. For near-optimality issue, we first derive a global probabilistic model of network management variables which characterizes the complex spatial dependence of the variables. The spatial dependence results from externally imposed management constraints and internal properties of communication environments. We then apply probabilistic graphical models in machine learning to show when and whether the global model can be approximated by a local model. This study results in a sufficient condition for distributed management to be nearly optimal. We then show how to obtain a near-optimal configuration through decentralized adaptation of local configurations. We next derive a near-optimal distributed inference algorithm based on the derived local model. We characterize the trade-off between near-optimality and complexity of distributed and statistical management. We validate our formulation and theory through simulations.

The objective of this thesis research is to optimize network throughput and fairness, and enhance bandwidth utilization in wireless mobile multi-hop relay (MMR) networks. To enhance bandwidth utilization, we propose an adaptive OFDMA frame structure which is used by the base station and the non-transparent relay stations. To optimize throughput and fairness, we develop an adaptive OFDMA allocation algorithm by using the proposed adaptive OFDMA frame. The effectiveness of the proposed schemes has been verified by numeric simulations. Providing ubiquitous coverage with wireless metropolitan area networks (WMANs) can be costly, especially in sparsely populated areas. In this scenario, cheaper relay stations (RSs) can be used to provide coverage instead of expensive base stations (BSs). The RS extends the coverage area of traditional BSs. This sort of network is known as a wireless MMR network. This thesis focuses on MMR networks that use orthogonal frequency division multiple access (OFDMA) and time division duplex (TDD) as a multiple access scheme and a duplex communication technique (e.g., WiMAX). The use of OFDMA resources (e.g., OFDMA symbols and subcarriers) and how they are shared in current schemes can reduce system capacity and network throughput in certain scenarios. To increase the capacity of the MMR network, we propose a new protocol that uses an adaptive OFDMA frame structure for BSs and RSs. We also propose adaptive OFDMA resource allocation for subscriber stations (SSs) within a BS or RS. We derive the maximum OFDMA resources that RSs can be assigned and synchronize access zones and relay zones between a superior station and its subordinate RSs. This is bounded by three properties defined in this thesis: a data relay property, a maximum balance property, and a relay zone limitation property. Finally, we propose max-min and proportional fairness schemes that use the proposed adaptive frame structure. The proposed scheme is the first approach that incorporates the adaptive technique for wireless MMR networks. We evaluate our scheme using simulations and numerical analysis. Results show that our technique improves resource allocation in wireless MMR networks. Further, in asymmetric distributions of SSs between access zones and relay zones, the proposed OFDMA allocation scheme performs two times better than the non-adaptive allocation scheme in terms of average max-min fairness and 70% better in terms of average throughput.

Recently, there has been a global trend among the telecommunication industry on the rapid deployment of IPTV (Internet Protocol Television) infrastructure and services. While the industry rushes into the IPTV era, the comprehensive understanding of the status and dynamics of IPTV network lags behind. Filling this gap requires in-depth analysis of large amounts of measurement data across the IPTV network. One type of the data of particular interest is device or system log, which has not been systematically studied before. In this dissertation, we will explore the possibility of utilizing system logs to serve a wide range of IPTV network management purposes including health monitoring, troubleshooting and performance evaluation, etc. In particular, we develop a tool to convert raw router syslogs to meaningful network events. In addition, by analyzing set-top box (STB) logs, we propose a series of models to capture both channel popularity and dynamics, and users' activity on the IPTV network.

Optical fiber technology continues to advance rapidly as a result of the increasing demands on communication systems and the expanding use of fiber-based sensing. New optical fiber types and fiber-based communications components are required to permit higher data rates, an increased number of channels, and more flexible installation requirements. Fiber-based sensors are continually being developed for a broad range of sensing applications, including environmental, medical, structural, industrial, and military. As optical fibers and fiber-based devices continue to advance, the need to understand their fundamental physical properties increases. The residual-stress distribution (RSD) and the refractive-index distribution (RID) play fundamental roles in the operation and performance of optical fibers. Custom RIDs are used to tailor the transmission properties of fibers used for long-distance transmission and to enable fiber-based devices such as long-period fiber gratings (LPFGs). The introduction and modification of RSDs enable specialty fibers, such as polarization-maintaining fiber, and contribute to the operation of fiber-based devices. Furthermore, the RSD and the RID are inherently linked through the photoelastic effect. Therefore, both the RSD and the RID need to be characterized because these fundamental properties are coupled and affect the fabrication, operation, and performance of fibers and fiber-based devices. To characterize effectively the physical properties of optical fibers, the RSD and the RID must be measured without perturbing or destroying the optical fiber. Furthermore, the techniques used must not be limited in detecting small variations and asymmetries in all directions through the fiber. Finally, the RSD and the RID must be characterized concurrently without moving the fiber to enable the analysis of the relationship between the RSD and the RID. Although many techniques exist for characterizing the residual stress and the refractive index in optical fibers, there is no existing methodology that meets all of these requirements. Therefore, the primary objective of the research presented in this thesis was to provide a methodology that is capable of characterizing concurrently the three-dimensional RSD and RID in optical fibers and fiber-based devices. This research represents a detailed study of the requirements for characterizing optical fibers and how these requirements are met through appropriate data analysis and experimental apparatus design and implementation. To validate the developed methodology, the secondary objective of this research was to characterize both unperturbed and modified optical fibers. The RSD and the RID were measured in a standard telecommunications-grade optical fiber, Corning SMF-28. The effects of cleaving this fiber were also analyzed and the longitudinal variations that result from cleaving were explored for the first time. The fabrication of carbon-dioxide-laser-induced LPFGs was also examined. These devices provide many of the functionalities required for fiber-based communications components as well as fiber-based sensors, and they offer relaxed fabrication requirements when compared to LPFGs fabricated by other methods. The developed methodology was used to perform the first measurements of the changes that occur in the RSD and the RID during LPFG fabrication. The analysis of these measurements ties together many of the existing theories of carbon-dioxide-laser-induced LPFG fabrication to present a more coherent understanding of the processes that occur. In addition, new evidence provides detailed information on the functional form of the RSD and the RID in LPFGs. This information is crucial for the modeling of LPFG behavior, for the design of LPFGs for specific applications, for the tailoring of fabrication parameters to meet design requirements, and for understanding the limitations of LPFG fabrication in commercial optical fibers. Future areas of research concerning the improvement of the developed methodology, the need to characterize other fibers and fiber-based devices, and the characterization of carbon-dioxide-laser-induced LPFGs are identified and discussed.

Thesis (M.S.)--University of North Texas, August, 2009. / Title from title page display. Includes bibliographical references.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 143-150). Available also in a digital version from Dissertation Abstracts.

Among the recent advances in the area of low-density parity-check (LDPC) codes, protograph-based LDPC codes have the advantages of a simple design procedure and highly structured encoders and decoders. These advantages can also be exploited in the design of protograph-based generalized LDPC (G-LDPC) codes. In this dissertation we provide analytical tools which aid the design of protograph-based LDPC and G-LDPC codes. Specifically, we propose a method for computing the codeword-weight enumerators for finite-length protograph-based G-LDPC code ensembles, and then we consider the asymptotic case when the block-length goes to infinity. These results help the designer identify good ensembles of protograph-based G-LDPC codes in the minimum distance sense (i.e., ensembles which have minimum distances grow linearly with code length). Furthermore, good code ensembles can be characterized by good stopping set, trapping set, or pseudocodeword properties, which assist in the design of G-LDPC codes with low floors. We leverage our method for computing codeword-weight enumerators to compute stopping-set, and pseudocodeword enumerators for the finite-length and the asymptotic ensembles of protograph-based G-LDPC codes. Moreover, we introduce a method for computing trapping set enumerators for finite-length (and asymptotic) protograph-based LDPC code ensembles. Trapping set enumerators for G-LDPC codes represents a more complex problem which we do not consider here. Inspired by our method for computing trapping set enumerators for protograph-based LDPC code ensembles, we developed an algorithm for estimating the trapping set enumerators for a specific LDPC code given its parity-check matrix. We used this algorithm to enumerate trapping sets for several LDPC codes from communication standards. Finally, we study coded-modulation schemes with LDPC codes and pulse position modulation (LDPC-PPM) over the free-space optical channel. We present three different decoding schemes and compare their performances. In addition, we developed a new density evolution tool for use in the design of LDPC codes with good performances over this channel.