Design of personalized location areas for future Pcs networks

In Global Systems for Mobile Communications (GSM), always-update location strategy is used to keep track of mobile terminals within the network. However future Personal Communication Networks (PCS) will require to serve a wide range of services (digital voice, video, data, and email) and also will have to support a large population of users. Under such demands, determining the exact location of a user by traditional strategies would be difficult and would result in increasing the signaling load imposed by location-update and paging procedures. The problem is not only in increasing cost, but also in non-efficient utilization of a precious resource, i.e., radio bandwidth; In this thesis, personalized Location Areas (PLAs) are formed considering the mobility patterns of individual users in the system such that the signaling due to location update and paging is minimized. We prove that the problem in this formulation is of NP complexity. Therefore we study efficient optimization techniques able to avoid combinatorial search. Three known classes of optimization techniques are studied. They are Simulated Annealing, Tabu Search and Genetic Search. Three algorithms are designed for solving the problem. Modeling does not assume any specific cell structure or network topology that makes the proposal widely applicable. The behavior of mobile terminals in the network is modeled as Random Walk with an absorbing state and the Markov chain is used for cost analysis; Numeric simulation carried out for 25 and 100 hexagonal cell networks have shown that Simulated Annealing based algorithm outperforms other two by indicators of the runtime complexity and signaling cost of location management. The ID\u27s of cells populating the calculated area are provided to the mobile terminal and saved in its local memory every time the mobile subscriber moves out its current location area. Otherwise, no location update is performed, but only paging. Thus, at the expense of small local memory, the location management is carried more efficiently

Location management in cellular networks using soft computing algorithms

The enormous increase in mobile subscribers in recent years has resulted in exploitation of wireless network resources, in particular, the bandwidth available. For the efficient use of the limited available bandwidth and to increase the capacity of the network, frequency re-use concept is adopted in cellular networks which led to increased number of cells in the network. This led to difficulty in finding the location of a mobile user in the network and increase in the signalling cost. Location management deals with keeping track of an active mobile terminal in a specific area while minimizing the cost incurred in finding the mobile terminal. The existing location management is done by grouping the cells based on subscriber density. Location management strategies are based on user mobility and incoming call arrival rate to a mobile terminal, which implies that the location management cost comprises of location update cost and paging cost. Reporting cell planning is an efficient location management scheme wherein few cells in the network as assigned as reporting cells, which take the responsibility of managing the location update and paging procedures in the network. Therefore, the need of the hour is to determine an optimal reporting cell configuration where the location management cost is reduced and thereby maintaining a trade-off between location update and paging cost. The reporting cell discrete optimization problem is solved using genetic algorithm, swarm intelligence technique and differential evolution. A comparative study of these techniques with the algorithms implemented by other researchers is done. It is observed that binary differential evolution outperforms other optimization techniques used for cost optimization. The current work can be extended to dynamic location management to assign and manage reporting cells in real-time implementable fashion

Simulated Annealing for Location Area Planning in Cellular networks

LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update rate and expected paging rate within LA. To get optimal result for LA planning in cellular network simulated annealing algorithm is used. Simulated annealing give optimal results in acceptable run-time.Comment: 7 Pages, JGraph-Hoc Journa

Solving the Location Area Problem by Using Differential Evolution

In mobile networks, one of the hard tasks is to determine the best partitioning in the Location Area problem, but it is also an important strategy to try to reduce all the involved management costs. In this paper we present a new approach to solve the location management problem based on the Location Area partitioning, as a cost optimization problem. We use a Differential Evolution based algorithm to find the best configuration to the Location Areas in a mobile network. We try to find the best values for the Differential Evolution parameters as well as define the scheme that enables us to obtain better results, when compared to classical strategies and to other authors’ results. To obtain the best solution we develop four distinct experiments, each one applied to one Differential Evolution parameter. This is a new approach to this problem that has given us good results

Learning-based tracking area list management in 4G and 5G networks

© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksMobility management in 5G networks is a very challenging issue. It requires novel ideas and improved management so that signaling is kept minimized and far from congesting the network. Mobile networks have become massive generators of data and in the forthcoming years this data is expected to increase drastically. The use of intelligence and analytics based on big data is a good ally for operators to enhance operational efficiency and provide individualized services. This work proposes to exploit User Equipment (UE) patterns and hidden relationships from geo-spatial time series to minimize signaling due to idle mode mobility. We propose a holistic methodology to generate optimized Tracking Area Lists (TALs) in a per UE manner, considering its learned individual behavior. The k -means algorithm is proposed to find the allocation of cells into tracking areas. This is used as a basis for the TALs optimization itself, which follows a combined multi-objective and single-objective approach depending on the UE behavior. The last stage identifies UE profiles and performs the allocation of the TAL by using a neural network. The goodness of each technique has been evaluated individually and jointly under very realistic conditions and different situations. Results demonstrate important signaling reductions and good sensitivity to changing conditions.This work was supported by the Spanish National Science Council and ERFD funds under projects TEC2014-60258-C2-2-R and RTI2018-099880-B-C32.Peer ReviewedPostprint (author's final draft

Intelligent Advancements in Location Management and C-RAN Power-Aware Resource Allocation

The evolving of cellular networks within the last decade continues to focus on delivering a robust and reliable means to cope with the increasing number of users and demanded capacity. Recent advancements of cellular networks such as Long-Term Evolution (LTE) and LTE-advanced offer a remarkable high bandwidth connectivity delivered to the users. Signalling overhead is one of the vital issues that impact the cellular behavior. Causing a significant load in the core network hence effecting the cellular network reliability. Moreover, the signaling overhead decreases the Quality of Experience (QoE) of users. The first topic of the thesis attempts to reduce the signaling overhead by developing intelligent location management techniques that minimize paging and Tracking Area Update (TAU) signals. Consequently, the corresponding optimization problems are formulated. Furthermore, several techniques and heuristic algorithms are implemented to solve the formulated problems. Additionally, network scalability has become a challenging aspect that has been hindered by the current network architecture. As a result, Cloud Radio Access Networks (C-RANs) have been introduced as a new trend in wireless technologies to address this challenge. C-RAN architecture consists of: Remote Radio Head (RRH), Baseband Unit (BBU), and the optical network connecting them. However, RRH-to-BBU resource allocation can cause a significant downgrade in efficiency, particularly the allocation of the computational resources in the BBU pool to densely deployed small cells. This causes a vast increase in the power consumption and wasteful resources. Therefore, the second topic of the thesis discusses C-RAN infrastructure, particularly where a pool of BBUs are gathered to process the computational resources. We argue that there is a need of optimizing the processing capacity in order to minimize the power consumption and increase the overall system efficiency. Consequently, the optimal allocation of computational resources between the RRHs and BBUs is modeled. Furthermore, in order to get an optimal RRH-to-BBU allocation, it is essential to have an optimal physical resource allocation for users to determine the required computational resources. For this purpose, an optimization problem that models the assignment of resources at these two levels (from physical resources to users and from RRHs to BBUs) is formulated

Group Search Optimizer for the Mobile Location Management Problem

We propose a diversity-guided group search optimizer-based approach for solving the location management problem in mobile computing. The location management problem, which is to find the optimal network configurations of management under the mobile computing environment, is considered here as an optimization problem. The proposed diversity-guided group search optimizer algorithm is realized with the aid of diversity operator, which helps alleviate the premature convergence problem of group search optimizer algorithm, a successful optimization algorithm inspired by the animal behavior. To address the location management problem, diversity-guided group search optimizer algorithm is exploited to optimize network configurations of management by minimizing the sum of location update cost and location paging cost. Experimental results illustrate the effectiveness of the proposed approach