261 research outputs found

    A learning approach for prioritized handoff channel allocation in mobile multimedia networks

    Get PDF
    An efficient channel allocation policy that prioritizes handoffs is an indispensable ingredient in future cellular networks in order to support multimedia traffic while ensuring quality of service requirements (QoS). In this paper we study the application of a reinforcement-learning algorithm to develop an alternative channel allocation scheme in mobile cellular networks that supports multiple heterogeneous traffic classes. The proposed scheme prioritizes handoff call requests over new calls and provides differentiated services for different traffic classes with diverse characteristics and quality of service requirements. Furthermore, it is asymptotically optimal, computationally inexpensive, model-free, and can adapt to changing traffic conditions. Simulations are provided to compare the effectiveness of the proposed algorithm with other known resource-sharing policies such as complete sharing and reservation policies

    Improved handoff mechanism for infiltrating user equipments in composite networks

    Get PDF
    The wireless technology and communication plays a vital role in our daily life. The end users are expecting more Quality of Experience (QOE) rather than the Quality of Service (QOS). In order to provide full signal coverage the entire cellular network coverage is divided in to small cells called as femtocells, those femtocells are covered with femtocell antennas which are very small in size compared with regular antennas. With these femtocell coverage problem is solved but when a user moves from one location to another location the user has to switch from one base station to so many base station which cannot be maintained with present handoff methods. The present hand off methods working on distance calculation approach, the proposed method is based on the velocity and device direction calculated based on GPS location toward the Base Station (BS) of the device which may ping pong handoff effect

    QoS Provisioning for Multi-Class Traffic in Wireless Networks

    Get PDF
    Physical constraints, bandwidth constraints and host mobility all contribute to the difficulty of providing Quality of Service (QoS) guarantees in wireless networks. There is a growing demand for wireless networks to support all the services that are available on wired networks. These diverse services, such as email, instant messaging, web browsing, video conferencing, telephony and paging all place different demands on the network, making QoS provisioning for wireless networks that carry multiple classes of traffic a complex problem. We have developed a set of admission control and resource reservation schemes for QoS provisioning in multi-class wireless networks. We present three variations of a novel resource borrowing scheme for cellular networks that exploits the ability of some multimedia applications to adapt to transient fluctuations in the supplied resources. The first of the schemes is shown to be proportionally fair: the second scheme is max-min fair. The third scheme for cellular networks uses knowledge about the relationship between streams that together comprise a multimedia session in order to further improve performance. We also present a predictive resource reservation scheme for LEO satellite networks that exploits the regularity of the movement patterns of mobile hosts in LEO satellite networks. We have developed the cellular network simulator (CNS) for evaluating call-level QoS provisioning schemes. QoS at the call-level is concerned with call blocking probability (CBP), call dropping probability (CDP), and supplied bandwidth. We introduce two novel QoS parameters that relate to supplied bandwidth—the average percent of desired bandwidth supplied (DBS), and the percent of time spent operating at the desired bandwidth level (DBT)

    Packet scheduling algorithms in LTE systems

    Full text link
    University of Technology Sydney. Faculty of Engineering and Information Technology.There has been a huge increase in demand towards improving the Quality of Service (QoS) of wireless services. Long Term Evolution (LTE) is a development of the Third-Generation Partnership Project (3GPP) with the aim to meet the needs of International Telecommunication Union (ITU). Some of its aspects are highlighted as follows: increase in data rate, scalable bandwidth, reduced latency and increase in coverage and capacity that result in better quality of service in communication. LTE employs Orthogonal Frequency Division Multiple Access (OFDMA) to simultaneously deliver multimedia services at a high speed rate. Packet switching is used by LTE to support different media services. To meet the QoS requirements for LTE networks, packet scheduling has been employed. Packet scheduling decides when and how different packets are delivered to the receiver. It is responsible for smart user packet selection to allocate radio resources appropriately. Therefore, packet scheduling should be cleverly designed to achieve QoS that is similar to fixed line services. eNodeB is a node in LTE network which is responsible for radio resource management that involves packet scheduling. There are two main categories of application in multimedia services: RT (Real Time) and NRT (None Real Time) services. RT services are either delay sensitive (e.g. voice over IP), loss sensitive (e.g. Buffered Video) or both (delay &loss sensitive) for example video conferencing. Best effort users are an example of NRT services that do not have exact requisites and have been allocated to spare resources. Reaching higher throughput has sometimes resulted in unfair allocation to users who are located far from the base station or users who suffer from bad channel conditions. Therefore, a sufficient trade-off between throughput and fairness is essential. The scarce bandwidth, fading radio channels and the QoS requirement of the users, makes resource allocation a demanding issue. Different scheduling approaches have been suggested for different service demands described briefly throughout the thesis. Initially, a comprehensive literature review of existing work on the packet scheduling topic has been accomplished in this thesis to realize the characteristics of packet scheduling and the resource allocation for the wireless network. Many packet scheduling algorithms developed to provide satisfactory QoS for multimedia services in downlink LTE systems. Several algorithms considered in this thesis include time and frequency domain algorithms and their way of approach has been investigated. The next objective of this thesis is to improve the performance of packet scheduling in LTE downlink systems. A new packet scheduling algorithm has been introduced in this thesis. A study on VoLTE (Voice over LTE), video streaming and best effort traffic under three different scheduling algorithms has been conducted. Heterogeneous traffic based on precise modelling of packets has been used in the simulation. The main resource allocation and assignment technique used in this work namely Dynamic Subcarrier Allocation scheme is shown to provide a solution to solve the cross layer optimisation problem. It depends on Channel Quality Information (CQI) and has been broadly investigated for single carrier and multicarrier wireless networks. The problem is based on the maximisation of average utility functions. Different scheduling algorithms in this method consider to be utility functions. The throughput, fairness and Packet Loss Ratio have been considered as the requirements for examining the performance of algorithms. Simulation results show that the proposed algorithm significantly increases the performance of streaming and best effort users in terms of PLR and throughput. Fairness has also been improved with less computational complexity compared to previous algorithms that have been introduced in this thesis
    corecore