An admission control scheme for IEEE 802.11e wireless local area networks

Includes bibliographical references (leaves 80-84).Recent times has seen a tremendous increase in the deployment and use of 802.11 Wireless Local Area Networks (WLANs). These networks are easy to deploy and maintain, while providing reasonably high data rates at a low cost. In the paradigm of Next-Generation-Networks (NGNs), WLANs can be seen as an important access network technology to support IP multimedia services. However a traditional WLAN does not provide Quality of Service (QoS) support since it was originally designed for best effort operation. The IEEE 802. 11e standard was introduced to overcome the lack of QoS support for the legacy IEEE 802 .11 WLANs. It enhances the Media Access Control (MAC) layer operations to incorporate service differentiation. However, there is a need to prevent overloading of wireless channels, since the QoS experienced by traffic flows is degraded with heavily loaded channels. An admission control scheme for IEEE 802.11e WLANs would be the best solution to limit the amount of multimedia traffic so that channel overloading can be prevented. Some of the work in the literature proposes admission control solutions to protect the QoS of real-time traffic for IEEE 802.11e Enhanced Distributed Channel Access (EDCA). However, these solutions often under-utilize the resources of the wireless channels. A measurement-aided model-based admission control scheme for IEEE 802.11e EDCA WLANs is proposed to provide reasonable bandwidth guarantees to all existing flows. The admission control scheme makes use of bandwidth estimations that allows the bandwidth guarantees of all the flows that are admitted into the network to be protected. The bandwidth estimations are obtained using a developed analytical model of IEEE 802.11e EDCA channels. The admission control scheme also aims to accept the maximum amount of flows that can be accommodated by the network's resources. Through simulations, the performance of the proposed admission control scheme is evaluated using NS-2. Results show that accurate bandwidth estimations can be obtained when comparing the estimated achievable bandwidth to actual simulated bandwidth. The results also validate that the bandwidth needs of all admitted traffic are always satisfied when the admission control scheme is applied. It was also found that the admission control scheme allows the maximum amount of flows to be admitted into the network, according the network's capacity

Queueing Networks for Vertical Handover

PhDIt is widely expected that next-generation wireless communication systems will be heterogeneous, integrating a wide variety of wireless access networks. Of particular interest recently is a mix of cellular networks (GSM/GPRS and WCDMA) and wireless local area networks (WLANs) to provide complementary features in terms of coverage, capacity and mobility support. If cellular/ WLAN interworking is to be the basis for a heterogeneous network then the analysis of complex handover traffic rates in the system (especially vertical handover) is one of the most essential issues to be considered. This thesis describes the application of queueing-network theory to the modelling of this heterogeneous wireless overlay system. A network of queues (or queueing network) is a powerful mathematical tool in the performance evaluation of many large-scale engineering systems. It has been used in the modelling of hierarchically structured cellular wireless networks with much success, including queueing network modelling in the study of cellular/ WLAN interworking systems. In the process of queueing network modelling, obtaining the network topology of a system is usually the first step in the construction of a good model, but this topology analysis has never before been used in the handover traffic study in heterogeneous overlay wireless networks. In this thesis, a new topology scheme to facilitate the analysis of handover traffic is proposed. The structural similarity between hierarchical cellular structure and heterogeneous wireless overlay networks is also compared. By replacing the microcells with WLANs in a hierarchical structure, the interworking system is modelled as an open network of Erlang loss systems and with the new topology, the performance measures of blocking probabilities and dropping probabilities can be determined. Both homogeneous and non-homogeneous traffic have been considered, circuit switched and packet-switched. Example scenarios have been used to validate the models, the numerical results showing clear agreement with the known validation scenarios

Towards the Quality of Service for VoIP traffic in IEEE 802.11 Wireless Networks

The usage of voice over IP (VoIP) traffic in IEEE 802.11 wireless networks is expected to increase in the near future due to widely deployed 802.11 wireless networks and VoIP services on fixed lines. However, the quality of service (QoS) of VoIP traffic in wireless networks is still unsatisfactory. In this thesis, I identify several sources for the QoS problems of VoIP traffic in IEEE 802.11 wireless networks and propose solutions for these problems. The QoS problems discussed can be divided into three categories, namely, user mobility, VoIP capacity, and call admission control. User mobility causes network disruptions during handoffs. In order to reduce the handoff time between Access Points (APs), I propose a new handoff algorithm, Selective Scanning and Caching, which finds available APs by scanning a minimum number of channels and furthermore allows clients to perform handoffs without scanning, by caching AP information. I also describe a new architecture for the client and server side for seamless IP layer handoffs, which are caused when mobile clients change the subnet due to layer 2 handoffs. I also present two methods to improve VoIP capacity for 802.11 networks, Adaptive Priority Control (APC) and Dynamic Point Coordination Function (DPCF). APC is a new packet scheduling algorithm at the AP and improves the capacity by balancing the uplink and downlink delay of VoIP traffic, and DPCF uses a polling based protocol and minimizes the bandwidth wasted from unnecessary polling, using a dynamic polling list. Additionally, I estimated the capacity for VoIP traffic in IEEE 802.11 wireless networks via theoretical analysis, simulations, and experiments in a wireless test-bed and show how to avoid mistakes in the measurements and comparisons. Finally, to protect the QoS for existing VoIP calls while maximizing the channel utilization, I propose a novel admission control algorithm called QP-CAT (Queue size Prediction using Computation of Additional Transmission), which accurately predicts the impact of new voice calls by virtually transmitting virtual new VoIP traffic

VOIP Model for ICT Rural Communities Telecentre in Sintok

Transmission of Voice over Internet Protocol (VoIP) on packet switching networks is one of the rapidly emerging real-time applications. VoIP is a formation of audio and voice communication. It receive voice signal activities then encoded in digital form and divided into small parts of information as like voice data network packets. These data network packets are decoded and transmitted voice in signals then sender and receiver having a voice conversion. In a voice conversion, the clients send and receive packets in a bidirectional method. Each client work as a sender and as a receiver depends on the direction of traffic flow over network. The aim of this proposal is to propose a VOIP model for ICT rural community’s telecaster in Sintok