Frequency reassignment in cellular phone networks

In cellular communications networks, cells use beacon frequencies to ensure the smooth operation of the network, for example in handling call handovers from one cell to another. These frequencies are assigned according to a frequency plan, which is updated from time to time, in response to evolving network requirements. The migration from one frequency plan to a new one proceeds in stages, governed by the network's base station controllers. Existing methods result in periods of reduced network availability or performance during the reassgnment process. The problem posed to the Study Group was to develop a dynamic reassignment algorithm for implementing a new frequency plan so that there is little or no disruption of the network's performance during the transition. This problem was naturally formulated in terms of graph colouring and an effective algorithm was developed based on a straightforward approach of search and random colouring

New algorithms to minimize handoff latency in AMTree protocol

In active networks, programs can be injected to network elements (routers/switches). This allows programmers to enhance existing protocols or deploy new protocols. AMTree protocol is an active network based protocol that makes sending packets to receivers, after source migration, an efficient process. In AMTree protocol, after source migration, handoff latency computed from the time of reconnecting to a new base station until finding nearest core to the mobile source. In this paper the authors present two new algorithms to minimize the handoff latency in AMTree protocol. They show that handoff latency is much lower than that of AMTree handoff algorithm if the mobile source connects to a base station which is subscribed to the multicast group

Calico Salmon Migration Algorithm: A novel meta-heuristic optimization algorithm

A novel population-based optimization method is proposed in this paper, the Calico Salmon Migration Algorithm (CSMA), which is inspired by the natural behavior of calico salmon during their migration for mating. The CSMA optimization process comprises four stages: selecting the search space by swimming into the river, expanding the search space from the river into the ocean, performing precise search during the migrating process, and breeding new subspecies by the remaining calico salmon population. To evaluate the effectiveness of the new optimizer, we conducted a series of experiments using different optimization problems and compared the results with various optimization algorithms in the literature. The numerical experimental results for benchmark functions demonstrate that the proposed CSMA outperforms other competing optimization algorithms in terms of convergence speed, accuracy, and stability. Furthermore, the Friedman ranking test shows that the CSMA is ranked first among similar algorithms

Animal Migration Optimization Algorithm Applied to Antenna Synthesis

In this thesis an Optimization Algorithm that is animal migration algorithm have taken and applied to antenna synthesis. This algorithm is a swarm intelligence technique which is an artificial intelligence technique, based on the self-organized system’s behavior. Optimization is nothing but getting a best solution from all possible solutions. If a situation is arises where there are lot of parameters are playing an important role in a problem then optimization is required to get the best solution. This Animal Migration Optimization algorithm evaluated from animal’s behavior. There are two processes involved in this algorithm. In the first process, how animals will move from the present position to a new position which is based on a neighborhood scheme which followed by ring topology. In the second process checks whether animal should stay in the group or not which is based on probability which is calculated based on the quality of fitness. This algorithm applied to antenna synthesis. To verify this AMO algorithm which is applied to antenna synthesis, convergence curve and AF plots for symmetric, Asymmetric and Circular geometry of antenna arrays are employed. For circular array geometry with 10 number of elements distance optimized, excitations and both optimized at a time. The proposed method has been compared with other optimization algorithms like CSO(cat swarm optimization)algorithm and PSO(particle swarm Optimization)algorithm and finally sensitive analysis is employed. Different distributions applied to AMO algorithm and finally worked out distribution explained. Convergence curve is shown for all distribution. Later this thesis pattern multiplication Concept explained when isotropic elements are replaced by anisotropic elements (for example micro strip antennas) where frequency of Operation comes into picture in such cases pattern multiplication Concept arrives. Introduction to Patch antenna and Design Considerations and polarization explained

Component-wise application migration in bidimensional cross-cloud environments

We propose an algorithm for the migration of cloud applications' components between different providers, possibly changing their service level between IaaS and PaaS. Our solution relies on three of the key ingredients of the trans-cloud approach: a unified API, agnostic topology descriptions, and mechanisms for the independent specification of providers. We show how our approach allows us to overcome some of the current interoperability and portability issues of cloud environments to propose a solution for migration, present an implementation of our proposed solution, and illustrate it with a case study and experimental results.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech