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

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 Comparative Study of Prioritized Handoff Schemes with Guard Channels in Wireless Cellular Networks

Mobility management has always been the main challenge in most mobile systems. It involves the management of network radio channel resource capacity for the purpose of achieving optimum quality of service (QoS) standard. In this era of wireless Personal Communication Networks such as Global System for Mobile Communication (GSM), Wireless Asynchronous Transfer Mode (WATM), Universal Mobile Telecommunication System (UMTS), there is a continuous increase in demand for network capacity. In order to accommodate the increased demand for network capacity (radio resource) over the wireless medium, cell sizes are reduced. As a result of such reduction in cell sizes, handoffs occur more frequently, and thereby result in increased volume of handoff related signaling. Therefore, a handoff scheme that can handle the increased signaling load while sustaining the standard QoS parameters is required.This work presents a comparative analysis of four popular developed handoff schemes. New call blocking probability, forced termination probability and throughput are the QoS parameters employed in comparing the four schemes. The four schemes are:RCS-GC,MRCS-GC, NCBS-GC, and APS-GC. NCBS-GChas the leased new call blocking probability while APS-GC has the worst. In terms of forced termination probability, MRCS-GC has the best result, whileRCS-GChas the worst scheme.MRCS-GC delivers the highest number of packets per second while APS-GC delivers the least. These performance metrics are computed by using the analytical expressions developed for these metrics in the considered models in a Microsoft Excel spreadsheet environment.http://dx.doi.org/10.4314/njt.v34i3.2

Cognitive MAC protocols for mobile Ad-Hoc networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The term of Cognitive Radio (CR) used to indicate that spectrum radio could be accessed dynamically and opportunistically by unlicensed users. In CR Networks, Interference between nodes, hidden terminal problem, and spectrum sensing errors are big issues to be widely discussed in the research field nowadays. To improve the performance of such kind of networks, this thesis proposes Cognitive Medium Access Control (MAC) protocols for Mobile Ad-Hoc Networks (MANETs). From the concept of CR, this thesis has been able to develop a cognitive MAC framework in which a cognitive process consisting of cognitive elements is considered, which can make efficient decisions to optimise the CR network. In this context, three different scenarios to maximize the secondary user's throughput have been proposed. We found that the throughput improvement depends on the transition probabilities. However, considering the past information state of the spectrum can dramatically increases the secondary user's throughput by up to 40%. Moreover, by increasing the number of channels, the throughput of the network can be improved about 25%. Furthermore, to study the impact of Physical (PHY) Layer errors on cognitive MAC layer in MANETs, in this thesis, a Sensing Error-Aware MAC protocols for MANETs has been proposed. The developed model has been able to improve the MAC layer performance under the challenge of sensing errors. In this context, the proposed model examined two sensing error probabilities: the false alarm probability and the missed detection probability. The simulation results have shown that both probabilities could be adapted to maintain the false alarm probability at certain values to achieve good results. Finally, in this thesis, a cooperative sensing scheme with interference mitigation for Cognitive Wireless Mesh Networks (CogMesh) has been proposed. Moreover, a prioritybased traffic scenario to analyze the problem of packet delay and a novel technique for dynamic channel allocation in CogMesh is presented. Considering each channel in the system as a sub-server, the average delay of the users' packets is reduced and the cooperative sensing scenario dramatically increases the network throughput 50% more as the number of arrival rate is increased

Queueing models for capacity changes in cellular networks

With the rapid development of cellular communication techniques, many recent studies have focused on improving the quality of service (QoS) in cellular networks. One characteristic of the systems in cellular networks, which can have direct impact on the system QoS, is the fluctuation of the system capacity. In this thesis, the QoS of systems with capacity fluctuations is studied from two perspectives: (1) priority queueing systems with preemption, and (2) the M/M/~C/~C system. In the first part, we propose two models with controlled preemption and analyze their performance in the context of a single reference cell that supports two kinds of traffic (new calls and handoff calls). The formulae for calculating the performance measures of interest (i.e., handoff call blocking probability, new call blocking and dropping probabilities) are developed, and the procedures for solving optimization problems for the optimal number of channels required for each proposed model are established. The proposed controlled preemption models are then compared to existing non-preemption and full preemption models from the following three perspectives: (i) channel utilization, (ii) low priority call (i.e., new calls) performance, and (iii) flexibility to meet various constraints. The results showed that the proposed controlled preemption models are the best models overall. In the second part, the loss system with stochastic capacity, denoted by M/M/~C/~C, is analyzed using the Markov regenerative process (MRGP) method. Three different distributions of capacity interchange times (exponential, gamma, and Pareto) and three different capacity variation patterns (skip-free, distance-based, and uniform-based) are considered. Analytic expressions are derived to calculate call blocking and dropping probabilities and are verified by call level simulations. Finally, numerical examples are provided to determine the impact of different distributions of capacity interchange times and different capacity variation patterns on system performance

A distributed channel allocation scheme for cellular network using intelligent software agents

PhDAbstract not availabl

A network mobility management architecture for a heteregeneous network environment

Network mobility management enables mobility of personal area networks and vehicular networks across heterogeneous access networks using a Mobile Router. This dissertation presents a network mobility management architecture for minimizing the impact of handoffs on the communications of nodes in the mobile network. The architecture addresses mobility in legacy networks without infrastructure support, but can also exploit infrastructure support for improved handoff performance. Further, the proposed architecture increases the efficiency of communications of nodes in the mobile network with counter parts in the fixed network through the use of caching and route optimization. The performance and costs of the proposed architecture are evaluated through empirical and numerical analysis. The analysis shows the feasibility of the architecture in the networks of today and in those of the near future.Verkkojen liikkuuvudenhallinta mahdollistaa henkilökohtaisten ja ajoneuvoihin asennettujen verkkojen liikkuvuuden heterogeenisessä verkkoympäristössä käyttäen liikkuvaa reititintä. Tämä väitöskirja esittää uuden arkkitehtuurin verkkojen liikkuvuudenhallintaan, joka minimoi verkonvaihdon vaikutuksen päätelaitteiden yhteyksiin. Vanhoissa verkoissa, joiden infrastruktuuri ei tue verkkojen liikkuvuutta, verkonvaihdos täytyy hallita liikkuvassa reitittimessa. Standardoitu verkkojen liikkuvuudenhallintaprotokolla NEMO mahdollistaa tämän käyttäen ankkurisolmua kiinteässä verkossa pakettien toimittamiseen päätelaitteiden kommunikaatiokumppaneilta liikkuvalle reitittimelle. NEMO:ssa verkonvaihdos aiheuttaa käynnissä olevien yhteyksien keskeytymisen yli sekunnin mittaiseksi ajaksi, aiheuttaen merkittävää häiriötä viestintäsovelluksille. Esitetyssä arkkitehtuurissa verkonvaihdon vaikutus minimoidaan varustamalla liikkuva reititin kahdella radiolla. Käyttäen kahta radiota liikkuva reititin pystyy suorittamaan verkonvaihdon keskeyttämättä päätelaitteiden yhteyksiä, mikäli verkonvaihtoon on riittävästi aikaa. Käytettävissa oleva aika riippuu liikkuvan reitittimen nopeudesta ja radioverkon rakenteesta. Arkkitehtuuri osaa myös hyödyntää infrastruktuurin tukea saumattomaan verkonvaihtoon. Verkkoinfrastruktuurin tuki nopeuttaa verkonvaihdosprosessia, kasvattaenmaksimaalista verkonvaihdos tahtia. Tällöin liikkuva reitin voi käyttää lyhyen kantaman radioverkkoja, joiden solun säde on yli 80m, ajonopeuksilla 90m/s asti ilman, että verkonvaihdos keskeyttää päätelaitteiden yhteyksiä. Lisäksi ehdotettu arkkitehtuuri tehostaa kommunikaatiota käyttäen cache-palvelimia liikkuvassa ja kiinteässä verkossa ja optimoitua reititystä liikkuvien päätelaitteiden ja kiinteässä verkossa olevien kommunikaatiosolmujen välillä. Cache-palvelinarkkitehtuuri hyödyntää vapaita radioresursseja liikkuvan verkon cache-palvelimen välimuistin päivittämiseen. Heterogeenisessä verkkoympäristossä cache-palvelimen päivitys suoritetaan lyhyen kantaman laajakaistaisia radioverkkoja käyttäen. Liikkuvan reitittimen siirtyessä laajakaistaisen radioverkon peitealueen ulkopuolelle päätelaitteille palvellaan sisältöä, kuten www sivuja tai videota cache-palvelimelta, säästäen laajemman kantaman radioverkon rajoitetumpia resursseja. Arkkitehtuurissa käytetään optimoitua reititystä päätelaitteiden ja niiden kommunikaatiokumppaneiden välillä. Optimoitu reititysmekanismi vähentää liikkuvuudenhallintaan käytettyjen protokollien langattoman verkon resurssien kulutusta. Lisäksi optimoitu reititysmekanismi tehostaa pakettien reititystä käyttäen suorinta reittiä kommunikaatiosolmujen välillä. Esitetyn arkkitehtuurin suorituskyky arvioidaan empiirisen ja numeerisen analyysin avulla. Analyysi arvioi arkkitehtuurin suorituskykyä ja vertaa sitä aikaisemmin ehdotettuihin ratkaisuihin ja osoittaa arkkitehtuurin soveltuvan nykyisiin ja lähitulevaisuuden langattomiin verkkoihin.reviewe

Performance analysis of the interference adaptation dynamic channel allocation technique in wireless communication networks

Dynamic channel allocation (DCA) problem is one of the major research topics in the wireless networking area. The purpose of this technique is to relieve the contradiction between the increasing traffic load in wireless networks and the limited bandwidth resource across the air interface. The challenge of this problem comes from the following facts: a) even the basic DCA problem is shown to be NP-complete (none polynomial complete); b) the size of the state space of the problem is very large; and c) any practical DCA algorithm should run in real-time. Many heuristic DCA schemes have been proposed in the literature. It has been shown through simulation results that the interference adaptive dynamic channel allocation (IA-DCA) scheme is a promising strategy in Time Devision [sic] Multiple Accesss/Frequency Devision [sic] Multiple Accesss [sic] (TDMA/FDMA) based wireless communication systems. However, the analytical work on the IA-DCA strategy in the literature is nearly blank. The performance of a, DCA algorithm in TDMA/FDMA wireless systems is influenced by three factors: representation of the interference, traffic fluctuation, and the processing power of the algorithm. The major obstacle in analyzing IA-DCA is the computation of co-channel interference without the constraint of conventional channel reuse factors. To overcome this difficulty, one needs a representation pattern which can approximate the real interference distribution as accurately as desired, and is also computationally viable. For this purpose, a concept called channel reuse zone (CRZ) is introduced and the methodology of computing the area of a CRZ with an arbitrary, non-trivial channel reuse factor is defined. Based on this new concept, the computation of both downlink and uplink CO-channel interference is investigated with two different propagation models, namely a simplified deterministic model and a shadowing model. For the factor of the processing power, we proposed an idealized Interference Adaptation Maximum Packing (IAMP) scheme, which gives the upper bound of all IA-DCA schemes in terms of the system capacity. The effect of traffic dynamics is delt [sic] with in two steps. First, an asymptotic performance bound for the IA-DCA strategy is derived with the assumption of an arbitrarily large number of channels in the system. Then the performance bound for real wireless systems with the IA-DCA strategy is derived by alleviating this assumption. Our analytical result is compared with the performance bound drawn by Zander and Eriksson for reuse-partitioning DCA1 and some simulation results for IA-DCA in the literature. It turns out that the performance bound obtained in this work is much tighter than Zander and Eriksson\u27s bound and is in agreement with simulation results. 1only available for deterministic propagation model and downlink connection