Delay analysis for wireless applications using a multiservice multiqueue processor sharing model

The ongoing development of wireless networks supporting multimedia applications requires service providers to efficiently deliver complex Quality of Service (QoS) requirements. The wide range of new applications in these networks significantly increases the difficulty of network design and dimensioning to meet QoS requirements. Medium Access Control (MAC) protocols affect QoS achieved by wireless networks. Research on analysis and performance evaluation is important for the efficient protocol design. As wireless networks feature scarce resources that are simultaneously shared by all users, processor sharing (PS) models were proposed for modelling resource sharing mechanisms in such systems. In this thesis, multi-priority MAC protocols are proposed for handling the various service traffic types. Then, an investigation of multiservice multiqueue PS models is undertaken to analyse the delay for some recently proposed wireless applications. We start with an introduction to MAC protocols for wireless networks which are specified in IEEE standards and then review scheduling algorithms which were proposed to work with the underlying MAC protocols to cooperatively achieve QoS goals. An overview of the relevant literature is given on PS models for performance analysis and evaluation of scheduling algorithms. We propose a multiservice multiqueue PS model using a scheduling scheme in multimedia wireless networks with a comprehensive description of the analytical solution. Firstly, we describe the existing multiqueue processor sharing (MPS) model, which uses a fixed service quantum at each queue, and correct a subtle incongruity in previous solutions presented in the literature. Secondly, a new scheduling framework is proposed to extend the previous MPS model to a general case. This newly proposed analytical approach is based on the idea that the service quantum arranged by a MAC scheduling controller to service data units can be priority-based. We obtain a closed-form expression for the mean delay of each service class in this model. In summary, our new approach simplifies MAC protocols for multimedia applications into an analytical model that includes more complex and realistic traffic models without compromising details of the protocol and significantly reduces the number of MAC headers, thus the overall average delay will be decreased. In response to using the studied multiservice multiqueue PS models, we apply the MPS model to two wireless applications: Push to Talk (PTT) service over GPRS/GSM networks and the Worldwide Interoperability for Microwave Access (WiMAX) networks. We investigate the uplink delay of PTT over traditional GPRS/GSM networks and the uplink delay for WiMAX Subscriber Station scheduler under a priority-based fair scheduling. MAC structures capable of supporting dynamically varying traffic are studied for the networks, especially, with the consideration of implementation issues. The model provides useful insights into the dynamic performance behaviours of GPRS/GSM and WiMAX networks with respect to various system parameters and comprehensive traffic conditions. We then evaluate the model under some different practical traffic scenarios. Through modelling of the operation of wireless access systems, under a variety of multimedia traffic, our analytical approaches provide practical analysis guidelines for wireless network dimensioning

Channel Aware Uplink Scheduler for a Mobile Subscriber Station of IEEE 802.16e

The scheduling part of the IEEE 802.16 (WiMAX) standards is kept as an open issue to provide differentiation among equipment manufacturers and operators. The uplink scheduling is very significant and more complex compared to downlink scheduling. Uplink scheduling is divided into two parts; one is scheduling the resources among many users from a base station (BS) and the other is sharing the resources among its services in a single user. BS uplink scheduling has been given more attention compared to subscriber station (SS) uplink scheduling. SS scheduler plays a significant role in providing the quality of service (QoS) among its services. The channel status awareness is vital in designing the SS scheduler as the channel conditions vary for a mobile user. This work proposes a scheduling algorithm for SS, which utilizes the channel information and queue length variation for the reallocation of received aggregated bandwidth grant to optimize the QoS parameters. The performance of the proposed algorithm is studied by conducting simulations using QualNet 5.0.2 simulation tool. Simulation results demonstrate the effectiveness of the proposed algorithm to improve the QoS

Performance Evaluation of Connection Admission Control for IEEE 802.16 Networks

Quality of Service (QoS) provisioning to the various kinds of network traffic is one of the major design criteria of IEEE 802.16 WiMAX standard. The MAC and physical layers of 802.16 standards are designed to support different types of real time application by providing QoS. Scheduling, Connection Admission Control (CAC) and traffic policing are the major issues to ensure QoS. In standard, scheduling and admission control are kept as open issues. Admission control is the ability of a network to control admission of new traffic based on the availability of resources. As per the specification the CAC considers minimum reserved rate of a connection as an admission criterion, in which the system can admit more connections, but packets of admitted connection may encounter large delays. In this paper average data rate (avg-rate CAC) and maximum sustained rate (max-rate CAC) of the connections are considered as admission criteria in CAC, along with minimum reserved rate (min-rate CAC). The performance of the WiMAX network is evaluated and compared for min-rate, avg-rate and max-rate CAC by considering the performance metrics such as number of connections admitted, throughput and delay using QualNet simulation tool

Enhancing Scheduling for IEEE 802.16 Networks

The IEEE 802.16 standard defines the specifications of the Worldwide Interoperability for Microwave Access (WiMAX) technology as a Broadband Wireless Access network. This type of networks supports multiservice traffic (data, voice and video) and guarantees the Quality of Service at the MAC layer level. However, the IEEE 802.16 standard specifies three QoS components that reside in the MAC layer such as scheduler and call admission control. Although, the IEEE 802.16 defined the function of each component but left the implementation open for vendors and operators. In this thesis, we aim to design two new scheduling algorithms that guarantee QoS in WiMAX network. The new algorithms will consider application traffic requirements, channel condition states and compliant with the standard. The first algorithm is Deadline maximum Signal to Interference Ratio (DmSIR) scheduling algorithm and it is a modified version from maximum Signal to Interference Ratio (mSIR) scheduling algorithm. The DmSIR scheduling algorithm makes scheduling decision based on two factors: the packets deadline and signal to noise ratio. The second algorithm which we named the Priority based Deficit Round Robin (PbDRR) solves the problem of long delay for non real-time traffic with low signal to noise ratio as well as giving priority to real-time traffic that approach to deadline. The PbDRR scheduling algorithm makes scheduling decision based on three factors: packets deadline, signal to noise ratio and backlog traffic. We used the NS2 network simulation to evaluate the performance of the new algorithms and three performance metrics are evaluated for this purpose. The simulation results for DmSIR shows enhancement in the performance compared to the mSIR scheduling algorithm but the non real-time traffic with low signal to noise ratio suffers from long delay. On the other hand, the simulation results for the PbDRR scheduling algorithm shows better performance than the DmSIR and Deficit Round Robin + Fragmentation (DRR+F) scheduling algorithms

Connection admission control and packet scheduling for IEEE 802.16 networks

Includes bibliographical references.The IEEE 802.16 standard introduced as one of the Wireless Metropolitan Area Networks (WMAN) for Broadband Wireless Access (BWA) which is known as Worldwide Interoperability for Microwave Access (WiMAX), provides a solution of broadband connectivity to areas where wired infrastructure is economically and technically infeasible. Apart from the advantage of having high speeds and low costs, IEEE 802.16 has the capability to simultaneously support various service types with required QoS characteristics. ... While IEEE 802.16 standard defines medium access control (MAC) and physical (PHY) layers specification, admission control and packet scheduling mechanisms which are important elements of QoS provisioning are left to vendors to design and implement for service differentiation and QoS support

An improved resource allocation scheme for WiMAX using channel information

In recent years, tremendous progress has been made in wireless communication systems to provide wireless coverage to end users at different data rates. WiMAX technology provides wireless broadband access over an extended coverage area in both fixed and mobility environments. Most of the existing resource allocation schemes allocate resources based on respective service class of the incoming users’ requests. However, due to variation in channel conditions, user mobility and diverse resource requirements QoS based resource allocation either results in over or under utilization of allocated resources. Therefore, resource allocation is a challenging task in WiMAX. This research proposes an improved resource management mechanism that performs resource allocation by taking into consideration not only the user service class but also the respective channel status. Based on these two parameters, this research aims to achieve improved resource allocation in terms of resource utilization, fairness and network throughput. First, a Channel Based Resource Allocation scheme is introduced where priority in resource allocation is given to users’ requests with relatively higher service classes and better channel status. To maintain fairness in resource allocation process, a Fair Resource Allocation Based Service mechanism is developed where priority is given to users’ requests having less additional resources demand. Finally, to improve throughput of the network, a Channel Based Throughput Improvement approach is proposed which dynamically selects a threshold level of channel gain based on individual channel gain of users. During resource allocation process, users above the threshold level are selected for resource allocation such that priority is given to users with high channel gain. Different simulation scenario results reveal an overall improved resource utilization from 87% to 91% and the throughput improves up to 15% when compared to existing schemes. In conclusion the performance of resource utilization is improved if channel status is considered as an input parameter