M. Tech. Electrical Engineering. / Discusses Call Admission Control (CAC) is a standard operating procedure responsible for accepting or rejecting calls based on the availability of network resources. It is also used to guarantee good Quality of Service (QoS) to ongoing users. However, there are a number of imprecisions to consider during the admission and handoff processes. These uncertainties arise from the mobility of subscribers and the time-varying nature of key admission factors such as latency and packet loss.These parameters are often imprecisely measured, which has a negative impact on the estimation of a channel spectral efficiency. In mobile networking, greater emphasis is towards delivering good QoS to real-time (RT) applications. It has become increasingly necessary to develop a model capable of handling uncertainties associated with the network in order to improve the quality of decisions relating to CAC. Type-1 and Type-2 Fuzzy Logic Controllers (FLCs) were deployed to allow the CAC to make better decisions in the presence of numerous uncertainties. The model successfully proposed associated meanings and degrees of certainty to the measured values of loss and latency by means of fuzzy sets and Membership Functions (MFs). The results obtained show that the fuzzy-based CAC performs better by reducing the call blocking and call dropping probabilities which are some of the key measurement parameters of QoS in wireless networking.

Thesis (Ph. D.)--Ohio State University, 2005. / Title from first page of PDF file. Document formatted into pages; contains xix, 136 p.; also includes graphics (some col.). Includes bibliographical references (p. 129-136). Available online via OhioLINK's ETD Center

CAPES / Nessa dissertação de mestrado apresentamos um novo método HARQ para sistemas de comunicação cooperativa, denominado Retransmissão Parcial Codificada (RPC). Esse método é baseado na retransmissão de apenas uma fração da palavra código original por parte dos nós cooperativos, aplicando a essa fração um ganho de potência apropriado. Os resultados numéricos utilizando códigos LDPC e HARQ Tipo-I com Chase Combining mostram que o RPC supera os esquemas HARQ cooperativos tradicionais considerando os protocolos AAF e SDF. Além disso, mostramos que a vazão (throughput) do RPC, utilizando apenas um único relay, pode ser consideravelmente maior que a vazão de alguns métodos HARQ cooperativos que utilizam múltiplos relays. / In this master thesis we present a novel HARQ scheme for cooperative communication systems, called Coded Partial Retransmission (CPR). The method is based on the retransmission of only a fraction of the original codeword by the cooperating nodes, applying an appropriate power allocation. Numerical results using LDPC codes and Type-I HARQ with Chase Combining show that CPR outperforms regular cooperative HARQ techniques considering both AAF and SDF protocols. Additionally, we show that the CPR throughput, using a single relay, may be considerably larger than the throughput of some regular cooperative HARQ schemes using multiple relays.

CAPES / Nessa dissertação de mestrado apresentamos um novo método HARQ para sistemas de comunicação cooperativa, denominado Retransmissão Parcial Codificada (RPC). Esse método é baseado na retransmissão de apenas uma fração da palavra código original por parte dos nós cooperativos, aplicando a essa fração um ganho de potência apropriado. Os resultados numéricos utilizando códigos LDPC e HARQ Tipo-I com Chase Combining mostram que o RPC supera os esquemas HARQ cooperativos tradicionais considerando os protocolos AAF e SDF. Além disso, mostramos que a vazão (throughput) do RPC, utilizando apenas um único relay, pode ser consideravelmente maior que a vazão de alguns métodos HARQ cooperativos que utilizam múltiplos relays. / In this master thesis we present a novel HARQ scheme for cooperative communication systems, called Coded Partial Retransmission (CPR). The method is based on the retransmission of only a fraction of the original codeword by the cooperating nodes, applying an appropriate power allocation. Numerical results using LDPC codes and Type-I HARQ with Chase Combining show that CPR outperforms regular cooperative HARQ techniques considering both AAF and SDF protocols. Additionally, we show that the CPR throughput, using a single relay, may be considerably larger than the throughput of some regular cooperative HARQ schemes using multiple relays.

D.Ing. / Conventional traffic models used for the analysis of packet-switched data are Markovian in nature and are based on assumptions, such as Poissonian arrivals. The introduction of packet oriented networks has resulted in an influx of information highlighting numerous discrepancies from these assumptions. Several studies have shown that traffic patterns from diverse packet-switched networks and services exhibit the presence of properties such as self-similarity, long-range dependencies, slowly decaying variances, "heavy tailed" or power law distributions, and fractal structures. Heavy Tailed distributions decay slower than predicted by conventional exponential assumptions and lead to significant underestimation of network traffic variables. Furthermore, it was shown that the statistical multiplexing of multiple packet-switched sources do not give rise to a more homogenous aggregate, but that properties such as burstiness are conserved. The results of the above mentioned studies have shown that none of the commonly used traffic models and assumptions are able to completely capture the bursty behaviour of packet- and cellbased networks. Artificial Intelligent methods provide the capability to extract the inherent characteristics of a system and include soft decision-making approaches such as Fuzzy Logic. Adaptive methods such as Fuzzy Logic Self-learning algorithms have the potential to solve some of the most pressing problems of traffic Modelling and Management in modern packet-switched networks. This dissertation is concerned with providing alternative solutions to the mentioned problems, in the following three sub-sections; the Description of Heavy Tailed Arrival Distributions, Timeseries Forecasting of bursty Traffic Intensities, and Management related Soft Decision-Making. Although several alternative methods, such as Kalman Filters, Bayesian Distributions, Fractal Analysis and Neural Networks are considered, the main emphasis of this work is on Fuzzy Logic applications.

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Includes bibliographical references. / by Tam-Anh Chu. / M.S.

In past and recent literature, random access protocols have been investigated with growing interest. In particular, the Slotted ALOHA protocol has been extensively used in satellite communications, and has also attracted considerable attention in many areas of wireless communication systems, especially in the cellular mobile environment. In this thesis, we investigate the performance of Slotted ALOHA, an effective random access protocol, in a Weibull fading environment. We study the performance metrics based on the signal-to-interference-and-noise ratio (SINR) model, in a cellular network system, assuming two captures models. The capture effect, also called co-channel interference tolerance, is the ability to correctly receive a strong signal from one transmitter despite significant interference from other transmitters. We derive closed-formed expressions and numerical evaluations for both the capture probability and the system throughput. he analytical results will be validated with computer simulations. Finally, to mitigate the effects of Weibull fading channel we also consider the effect of dual selection diversity that will increase the capture probability and the system throughput. / by Jean N. Rene. / Thesis (M.S.C.S.)--Florida Atlantic University, 2013. / Includes bibliography. / Mode of access: World Wide Web. / System requirements: Adobe Reader.

Siu Chun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 66-68). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Thesis Overview --- p.3 / Chapter 2 --- Background and Related work --- p.4 / Chapter 2.1 --- Emergence of IP-over-ATM --- p.4 / Chapter 2.2 --- ATM architecture --- p.5 / Chapter 2.3 --- Scheduling issues in output-queued switch --- p.6 / Chapter 2.4 --- Scheduling issues in input-queued switch --- p.18 / Chapter 3 --- The Deadline-ordered Burst-based Parallel Scheduling Strategy --- p.23 / Chapter 3.1 --- Introduction --- p.23 / Chapter 3.2 --- Switch and queueing model --- p.24 / Chapter 3.2.1 --- Switch model --- p.24 / Chapter 3.2.2 --- Queueing model --- p.25 / Chapter 3.3 --- The DBPS Strategy --- p.26 / Chapter 3.3.1 --- Motivation --- p.26 / Chapter 3.3.2 --- Strategy --- p.31 / Chapter 3.4 --- The Deadline-ordered Burst-based Parallel Iterative Matching --- p.33 / Chapter 3.4.1 --- Algorithm --- p.34 / Chapter 3.4.2 --- An example of DBPIM --- p.35 / Chapter 3.5 --- Simulation results --- p.33 / Chapter 3.6 --- Discussions --- p.46 / Chapter 3.7 --- Future work --- p.47 / Chapter 4 --- The Quasi-static DBPIM Algorithm --- p.50 / Chapter 4.1 --- Introduction --- p.50 / Chapter 4.2 --- Quasi-static path scheduling principle --- p.51 / Chapter 4.3 --- Quasi-static DBPIM algorithm --- p.56 / Chapter 4.4 --- An example of Quasi-static DBPIM --- p.59 / Chapter 5 --- Conclusion --- p.63 / Bibliography --- p.65

Since the emergence of the Asynchronous Transfer Mode ( A TM ) concept, various switching architectures have been proposed. The multistage interconnection networks have been proposed for the switching architecture under the A TM environment. In this thesis, we propose a new model for the performance analysis of an A TM switching fabric based on single-buffered Banyan network. In this model, we use a three-state, i.e., "empty", "new" and "blocked" Markov chain model to describe the behavior of the buffer within a switching element. In addition to traditional statistical analysis including throughput and delay, we also examine the delay variation. Performance results show that the proposed model is more accurate in describing the switch behavior under uniform traffic environment in comparison with the "two-state" Markov chain model developed by Jenq, et. al.[4] [6] . Based on the "three-state" model, we study a packet priority scheme which gives the blocked packet higher priority to be routed forward during contention. It is found that the standard deviation of the network delay is reduced by about 30%.

This research is concerned with the reliable delivery of scalable compressed data over lossy communication channels. Recent works proposed several strategies for assigning optimal code redundancies to elements of scalable data, which form a linear structure of dependency, under the assumption that all source elements are encoded onto a common group of network packets. Given large data and small network packets, such schemes require very long channel codes with high computational complexity. In networks with high loss, small packets are more desirable than long packets. The first contribution of this thesis is to propose a strategy for optimally assigning elements of the scalable data to clusters of packets, subject to constraints on packet size and code complexity. Given a packet cluster arrangement, the scheme then assigns optimal code redundancies to the source elements, subject to a constraint on transmission length. Experimental results show that the proposed strategy can outperform the previous code assignment schemes subject to the above-mentioned constraints, particularly at high channel loss rates. Secondly, we modify these schemes to accommodate complex structures of dependency. Source elements are allocated to clusters of packets according to their dependency structure, subject to constraints on packet size and channel codeword length. Given a packet cluster arrangement, the proposed schemes assign optimal code redundancies to the source elements, subject to a constraint on transmission length. Experimental results demonstrate the superiority of the proposed strategies for correctly modelling the dependency structure. The last contribution of this thesis is to propose a scheme for optimizing protection of scalable data where limited retransmission is possible. Previous work assumed that retransmission is not possible. For most real-time or interactive applications, however, retransmission of lost data may be possible up to some limit. In the present work we restrict our attention to streaming sources (e.g., video) where each source element can be transmitted in one or both of two time slots. An optimization algorithm determines the transmission and level of protection for each source element, using information about the success of earlier transmissions. Experimental results confirm the benefit of limited retransmission.