682 research outputs found

    Optimization of handover in mobile system by using dynamic guard channel method

    Get PDF
    Handover process is a very essential process in the Global System for Mobile Communication system (GSM). Its study is one of the major key performance indicators in every GSM network, and its linked to the quality of service of an each service provider strives to attain. The failure of the handover process is regarded as the drop of quality of service which in turn dissatisfies the customers. This study, contributes more on improving call drop rate in general, reduce handover failure rate and thus save on upgrade costs, this will be beneficial to GSM service providers to easily optimize their network faults relating to the resource management. In this paper, dynamic guard channel algorithm is presented that was developed using JAVA Software. This algorithm prioritizes the handover calls over the new originated calls. All handover calls are ongoing calls and if they are dropped it causes frustrations. Matlab was used to compare simulated results to the other schemes by use of graphs and charts.  From this paper we were able to establish and come up with a definitive solution to the handover crisis befalling telecommunication companies

    A Flexible Handoff Prioritization Scheme for Improved Quality of Service in Mobile Networks

    Get PDF
    Efficient handoff prioritization schemes make mobile networks to perform better. However, most existing schemes have the common characteristics of reducing the call drop probability and increasing the call block probability; this decreases the general network performance. The reservation of channels for the use of handoff calls alone has not proved to be an efficient approach to optimally utilize the network limited channel resources. These approaches are such that even when the reserved channels are not in use, new calls could still get blocked if there are no channels among the shared channels to allocate to the new calls. In trying to maintain an improved QoS for handoff calls while ensuring an acceptable QoS for new calls, different methods have been suggested for new calls to access and use the reserved channels while priority is still given to handoff calls since it is more frustrating to have an on-going call dropped than blocking a new call. Network parameters such as call drop probability and traffic intensity had been used separately to determine when new calls could be granted access to use the reserved channels or otherwise. Handoff queuing and other call admission control approaches have also been used. This paper proposes the use of traffic intensity and call drop probability to decide whether the new calls could use the reserved channels or not. Also proposed is the need to keep the number of reserved channels fixed rather than calculating the numbers to reserve per time therefore reducing the computational complexity of the scheme. The simulation results showed an improved QoS for the handoff calls while producing a commensurate improvement for the new calls through a reduced Call drop Probability and call block probability. Keywords: Call block probability, Call drop probability, traffic intensity, handoff prioritization, mobile network DOI: 10.7176/JIEA/11-1-03 Publication date: January 31st 202

    Final report on the evaluation of RRM/CRRM algorithms

    Get PDF
    Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

    Comparison of vertical handover decision-based techniques in heterogeneous networks

    Get PDF
    Industry leaders are currently setting out standards for 5G Networks projected for 2020 or even sooner. Future generation networks will be heterogeneous in nature because no single network type is capable of optimally meeting all the rapid changes in customer demands. Heterogeneous networks are typically characterized by some network architecture, base stations of varying transmission power, transmission solutions and the deployment of a mix of technologies (multiple radio access technologies). In heterogeneous networks, the processes involved when a mobile node successfully switches from one radio access technology to the other for the purpose of quality of service continuity is termed vertical handover or vertical handoff. Active calls that get dropped, or cases where there is discontinuity of service experienced by mobile users can be attributed to the phenomenon of delayed handover or an outright case of an unsuccessful handover procedure. This dissertation analyses the performance of a fuzzy-based VHO algorithm scheme in a Wi-Fi, WiMAX, UMTS and LTE integrated network using the OMNeT++ discrete event simulator. The loose coupling type network architecture is adopted and results of the simulation are analysed and compared for the two major categories of handover basis; multiple and single criteria based handover methods. The key performance indices from the simulations showed better overall throughput, better call dropped rate and shorter handover time duration for the multiple criteria based decision method compared to the single criteria based technique. This work also touches on current trends, challenges in area of seamless handover and initiatives for future Networks (Next Generation Heterogeneous Networks)

    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)

    User-oriented mobility management in cellular wireless networks

    Get PDF
    2020 Spring.Includes bibliographical references.Mobility Management (MM) in wireless mobile networks is a vital process to keep an individual User Equipment (UE) connected while moving within the network coverage area—this is required to keep the network informed about the UE's mobility (i.e., location changes). The network must identify the exact serving cell of a specific UE for the purpose of data-packet delivery. The two MM procedures that are necessary to localize a specific UE and deliver data packets to that UE are known as Tracking Area Update (TAU) and Paging, which are burdensome not only to the network resources but also UE's battery—the UE and network always initiate the TAU and Paging, respectively. These two procedures are used in current Long Term Evolution (LTE) and its next generation (5G) networks despite the drawback that it consumes bandwidth and energy. Because of potentially very high-volume traffic and increasing density of high-mobility UEs, the TAU/Paging procedure incurs significant costs in terms of the signaling overhead and the power consumption in the battery-limited UE. This problem will become even worse in 5G, which is expected to accommodate exceptional services, such as supporting mission-critical systems (close-to-zero latency) and extending battery lifetime (10 times longer). This dissertation examines and discusses a variety of solution schemes for both the TAU and Paging, emphasizing a new key design to accommodate 5G use cases. However, ongoing efforts are still developing new schemes to provide seamless connections to the ever-increasing density of high-mobility UEs. In this context and toward achieving 5G use cases, we propose a novel solution to solve the MM issues, named gNB-based UE Mobility Tracking (gNB-based UeMT). This solution has four features aligned with achieving 5G goals. First, the mobile UE will no longer trigger the TAU to report their location changes, giving much more power savings with no signaling overhead. Instead, second, the network elements, gNBs, take over the responsibility of Tracking and Locating these UE, giving always-known UE locations. Third, our Paging procedure is markedly improved over the conventional one, providing very fast UE reachability with no Paging messages being sent simultaneously. Fourth, our solution guarantees lightweight signaling overhead with very low Paging delay; our simulation studies show that it achieves about 92% reduction in the corresponding signaling overhead. To realize these four features, this solution adds no implementation complexity. Instead, it exploits the already existing LTE/5G communication protocols, functions, and measurement reports. Our gNB-based UeMT solution by design has the potential to deal with mission-critical applications. In this context, we introduce a new approach for mission-critical and public-safety communications. Our approach aims at emergency situations (e.g., natural disasters) in which the mobile wireless network becomes dysfunctional, partially or completely. Specifically, this approach is intended to provide swift network recovery for Search-and-Rescue Operations (SAROs) to search for survivors after large-scale disasters, which we call UE-based SAROs. These SAROs are based on the fact that increasingly almost everyone carries wireless mobile devices (UEs), which serve as human-based wireless sensors on the ground. Our UE-based SAROs are aimed at accounting for limited UE battery power while providing critical information to first responders, as follows: 1) generate immediate crisis maps for the disaster-impacted areas, 2) provide vital information about where the majority of survivors are clustered/crowded, and 3) prioritize the impacted areas to identify regions that urgently need communication coverage. UE-based SAROs offer first responders a vital tool to prioritize and manage SAROs efficiently and effectively in a timely manner

    Base Station controlled load balancing with handovers in Mobile WiMAX

    Get PDF
    Tämän diplomityön päätavoitteena on tutkia, kuinka kuorman tasaus voidaan suorittaa tukiaseman aloitteesta yhteysvastuun vaihdoilla mobiili WiMAX:ssa ja selvittää menetelmän potentiaalia edistää resurssien käyttöä sekä palvelun laatua koko systeemissä. Tavoitteena on myös tutkia alustavasti sitä, miten turvakaistoja voitaisiin varata ns. pelastavalle yhteysvastuun vaihdolle mobiili WiMAX:ssa, kuinka tämä vaikuttaisi kuorman tasaukseen ja kuinka nämä lähestymistavat voitaisiin yhdistää. Diplomityö sisältää koosteen IEEE 802.16e radiorajapintateknologian ja WiMAX Forum liityntäverkkoarkkitehtuurin tärkeimmistä elementeistä kuorman tasauksen ja yhteysvastuun vaihdon suhteen sekä kirjallisuuskatsauksen kuorman tasauksesta, sekä pelastavan yhteysvastuun vaihdon ja liikenteen priorisoinnista. Näiden perusteella suunniteltiin mobiili WiMAX:lle räätälöity resurssien käyttöön perustuva peruskuormantasausalgoritmi. Tämän lisäksi tehtiin muutama alustava ehdotus perusalgoritmia edistävistä menetelmistä. Näihin kuuluivat esimerkiksi kuorman tasauksen laukaisuun tarkoitetun kynnyksen automaattinen säätäminen, useiden kynnysten käyttäminen sekä resurssien varaukseen perustuva laukaisu, missä kuorman tasaus voidaan laukaista turvakaistojen suhteen. Lopuksi perusalgoritmi evaluoitiin staattisessa ympäristössä. Vaikka suoritetut simulaatiot eivät olleet laajamittaisia, perusalgoritmin parametreista ja yleisestä suorituskyvystä saatiin hyödyllistä informaatiota. Vaikka algoritmi suoriutui hyvin simuloidussa ympäristössä, aikaisemmin suunnitelluille edistäville menetelmille todettiin yleisesti ottaen selvä tarve. Tämän diplomityön pitäisi luoda hyvä pohja yhteysvastuun vaihtoon perustuvan kuorman tasauksen edelleen kehittämiselle ja evaluoinnille mobiili WiMAX:ssa. Tutkimuksen perusteella päädyttiin siihen johtopäätökseen, että kuorman tasaus yhteysvastuun vaihdolla voi olla todella tehokas tapa vapauttaa resursseja suurimmassa osassa ympäristöistä, mutta että turvakaistojen käyttöä tulisi silti harkita.The purpose of this thesis is to examine how load balancing with Base Station initiated directed handovers could be conducted in Mobile WiMAX and the potential it has to enhance Resource Utilization and QoS system wide. An additional goal of the thesis is also to conduct preliminary research on how guard bands for rescue handovers could be used in Mobile WiMAX, how this would affect load balancing and how these two approaches could be combined. The thesis includes a background study on the key system aspects of the IEEE 802.16e radio interface technology and WiMAX Forum Access Network Architecture in terms of load balancing and handovers and a literary review on load balancing, and system wide handover and traffic prioritization. Based on the gained knowledge a basic Resource Utilization based load balancing algorithm tailored for Mobile WiMAX is designed. Few preliminary enhancement proposals are also made in terms of e.g. automatic tuning of the triggering threshold, multiple threshold based triggering and Resource Reservation based triggering where load balancing can be triggered in relations to the reserved guard for rescue handovers and higher priority traffic. Finally preliminary evaluation of the basic algorithm in a static environment is conducted. Although the simulations are not extensive, beneficial information is obtained of the basic parameters of the algorithm and of the overall performance of the algorithm. Even though the basic algorithm performed well in the simulated environment, a clear need was recognized for the enhancements introduced earlier. All in all this thesis should form a very good basis for the further development and evaluation of handover based load balancing in Mobile WiMAX. Based on the study it was concluded that load balancing with directed handovers can be a very efficient way to release resources in most cases but the use of rescue handover guard bands should still be considered

    LTE Optimization and Resource Management in Wireless Heterogeneous Networks

    Get PDF
    Mobile communication technology is evolving with a great pace. The development of the Long Term Evolution (LTE) mobile system by 3GPP is one of the milestones in this direction. This work highlights a few areas in the LTE radio access network where the proposed innovative mechanisms can substantially improve overall LTE system performance. In order to further extend the capacity of LTE networks, an integration with the non-3GPP networks (e.g., WLAN, WiMAX etc.) is also proposed in this work. Moreover, it is discussed how bandwidth resources should be managed in such heterogeneous networks. The work has purposed a comprehensive system architecture as an overlay of the 3GPP defined SAE architecture, effective resource management mechanisms as well as a Linear Programming based analytical solution for the optimal network resource allocation problem. In addition, alternative computationally efficient heuristic based algorithms have also been designed to achieve near-optimal performance

    Seamless Mobility under a Dedicated Distributed Antenna System for High-Speed Rail Networks

    Get PDF
    High-speed railway (HSR) has demonstrated a tremendous growth worldwide, and currently is attaining a maximum velocity of 575 km/h. Such a high speed makes the mobile wireless communications a challenging task for HSR to sustain since the handover (HO) rate increases with speed which might result in a high loss of link connectivity. By employing a dedicated distributed antenna system (DAS) along with the two-hop network architecture for HSR wireless communications, this thesis aims to attain a high system capacity, a more transmission reliability, and consequently a superior mobile wireless communication quality-of-service (QoS) for commuters on HSR. First, this thesis proposes a frequency switch (FSW) scheme to mitigate the persistent HO issue in conventional HSR wireless communication systems. The proposed scheme significantly alleviates the interruption time and the dense signalling overhead associated with the traditional HO process, providing a much more convenient scheme, i.e. fast and soft which suits the remote antenna unit (RAU) small coverage area and the train's high moving speed. Therefore, FSW scheme provides mobility robustness signalling process that guarantees a more successful frequency switch instead of HO, thereby, reduces the probability of a radio link failure (RLF) compared with HO process in traditional HSR systems. Second, an enhanced fast predictive HO mechanism is proposed by starting the HO process earlier, when moving from one RAU coverage area to the next where these two RAUs are controlled by different central units (CUs). It shows that the proposed fast HO scheme achieves a lower HO command failure probability than the traditional HO. This leads to a lower HO failure probability which consequently can considerably enhance the end-users' quality-of-service (QoS) experience. Analytical results verify that the proposed schemes can improve the system performance substantially by delivering ultra-reliable low-latency communications. Finally, with the aim of providing an ultra-reliable low-latency wireless communications, this thesis also proposes an onboard frequency switch scheme to further simplify our previously proposed FSW scheme

    Quantum Reinforcement Learning for Dynamic Spectrum Access in Cognitive Radio Networks

    Get PDF
    Abstract This thesis proposes Quantum Reinforcement Learning (QRL) as an improvement to conventional reinforcement learning-based dynamic spectrum access used within cognitive radio networks. The aim is to overcome the slow convergence problem associated with exploration within reinforcement learning schemes. A literature review for the background of the carried out research work is illustrated. Review of research works on learning-based assignment techniques as well as quantum search techniques is provided. Modelling of three traditional dynamic channel assignment techniques is illustrated and the advantage characteristic of each technique is discussed. These techniques have been simulated to provide a comparison with learning based techniques, including QRL. Reinforcement learning techniques are used as a direct comparison with the Quantum Reinforcement Learning approaches. The elements of Quantum computation are then presented as an introduction to quantum search techniques. The Grover search algorithm is introduced. The algorithm is discussed from a theoretical perspective. The Grover algorithm is then used for the first time as a spectrum allocation scheme and compared to conventional schemes. Quantum Reinforcement Learning (QRL) is introduced as a natural evolution of the quantum search. The Grover search algorithm is combined as a decision making mechanism with conventional Reinforcement Learning (RL) algorithms resulting in a more efficient learning engine. Simulation results are provided and discussed. The convergence speed has been significantly increased. The beneficial effects of Quantum Reinforcement Learning (QRL) become more pronounced as the traffic load increases. The thesis shows that both system performance and capacity can be improved. Depending on the traffic load, the system capacity has improved by 9-84% from a number of users supported perspective. It also demonstrated file delay reduction for up to an average of 26% and 2.8% throughput improvement
    corecore