Total Location Management Cost Research Articles

Artificial intelligence‐based novel scheme for location area planning in cellular networks

AbstractPlanning of location area (LA) in cellular networks plays a vital role in utilizing the resources efficiently and economically. Location update and paging costs directly affect the cost to the service provider. When the size of the Mobile Switching Centre (MSC) is large, the paging cost becomes maximum. Though, no location update is required for this case. On the contrary, paging cost shoots high if each cell forms individual LA, but in this case, location update cost shoots to the maximum value. Therefore, deducing the network to the optimal amount of LA's is an intractable combinatorial optimization problem. In this paper, we intend to optimize the partitions of the MSC service area into an optimal number of LA, to curtail the total location management cost. We propose a novel scheme bearing in mind cell attributes of the network to deduce an optimum number of location areas, leading to minimum cost per call. It is revealed by the results of this work, attained after simulating the scenario on MATLAB 2018a that Cell Attributes Based Algorithm is a very promising scheme for cellular networks, and it outperforms the existing algorithms in a practical scenario.

Distance-Based Location Management Utilizing Initial Position for Mobile Communication Networks

This paper aims at improving the distance-based location management scheme for mobile communication networks. In location management, a mobile terminal (MT) is tracked based on its location-update area (LA). The improvement is brought about by joint optimization of LA center and LA size. For LA center optimization (LCO), we determine the optimal center position of the LA given the initial position of the MT upon each location update. The investigation of optimal LA center has eluded research to date. Based on the popular continuous-time random walk (CTRW) mobility model, we propose an analytical framework that uses a diffusion equation to determine the optimal LA center that minimizes the total cost of location management, consisting of the location update cost and terminal paging cost. This framework allows us to easily model the non-Markovian movement of the MT and evaluate the impact of various measurable physical parameters (such as length of road section, angle between road sections, and road section crossing time) and LA center. In particular, we show that proper LA center can significantly reduce the total cost. For example, for the circular LA and low Poisson call-arrival rate, optimizing the LA center alone has the potential of reducing the cost by up to 37 percent. Joint optimization of the LA center and terminal paging scheme can reduce the cost even further. Simulations results match the theoretical analysis to a gap within 3 percent, indicating that our theoretical model is very accurate.

The Metric and Cache-Based (MC-B) System for Location Management in Wireless Cellular Networks

In this paper, we proposed an efficient metric and cache based location management technique to identify the current location of mobile terminals. The attributes of this techniques are, metrics calculation, information exchange, optimal routing path selection and it's storage in the mobile switching center. For this, we introduced a novel architecture for mobile switching center, and it has several cache spaces. First, the mobile switching center will calculate the shortest metric-based path between current and master/previous location of mobile terminal and store its in the cache of the mobile switching center, thereafter it performs the location management procedure through the optimal suggested path by the mobile switching center. The analytical model checks the scalability and effectiveness of the proposed system over certain attributes and the comparison have been made with the existing techniques. It has been observed that the proposed technique reduced the signaling cost, registration delay, call setup delay, network overheads and total location management cost.

Analysis of Distance-Based Location Management in Wireless Communication Networks

The performance of dynamic distance-based location management schemes (DBLMS) in wireless communication networks is analyzed. A Markov chain is developed as a mobility model to describe the movement of a mobile terminal in 2D cellular structures. The paging area residence time is characterized for arbitrary cell residence time by using the Markov chain. The expected number of paging area boundary crossings and the cost of the distance-based location update method are analyzed by using the classical renewal theory for two different call handling models. For the call plus location update model, two cases are considered. In the first case, the intercall time has an arbitrary distribution and the cell residence time has an exponential distribution. In the second case, the intercall time has a hyper-Erlang distribution and the cell residence time has an arbitrary distribution. For the call without location update model, both intercall time and cell residence time can have arbitrary distributions. Our analysis makes it possible to find the optimal distance threshold that minimizes the total cost of location management in a DBLMS.

An efficient metric-based (EM-B) location management scheme for wireless cellular networks

In the current era, the wireless cellular network is gaining much attention in the network mobility for qualitative service. Towards enhancing the QoS and narrowing the dilemma of network management (location management) an efficient metric-based location management technique is introduced in this paper to capture the current location of mobile subscribers. The attributes of this technique are based on metrics calculation and location management message routing path determination. First, the current mobile switching center will calculate the shortest metric-based path between current and master (previous) location of mobile terminals (user), thereafter it performs the location management procedure through the optimal suggested path by the mobile switching center. This proposed technique will reduce the signaling cost, registration delay, call setup delay, network overheads and total location management cost. The proposed analytical model checks the scalability and effectiveness of proposed system over certain attributes and a comparison is made with the existing available techniques.

Cost analysis and minimization of movement-based location management schemes in wireless communication networks: a renewal process approach

The paper makes new contributions to cost analysis and minimization of movement-based location management schemes in wireless communication networks. The main contributions of the paper are three-fold. First, we consider two different call handling models, that is, the call plus location update (CPLU) model and the call without location update (CWLU) model. We point out that all existing analysis of location update cost of a movement-based location management scheme (MBLMS) do not accurately capture the essence of the two models. Second, we analyze the exact location update cost of an MBLMS under both CPLU and CWLU models using a renewal process approach which has rarely been used before. We find that the location update cost of an MBLMS under the CWLU model is much easier to analyze than that of an MBLMS under the CPLU model. Furthermore, an MBLMS operated under the CWLU model has lower location update cost than an MBLMS operated under the CPLU model. Third, we are able to derive a closed form solution to the movement threshold that minimizes the total cost of location management in an MBLMS for the CPLU model when the inter-call time has an arbitrary distribution and the cell residence time has an Erlang distribution, and for the CWLU model when both inter-call time and cell residence time have arbitrary distributions. Such closed form solutions have not been available in the existing literature.

Research on Location Management Based on Irregular Cellular Network Topology Model

Most strategies of location management are based on the hypothesis that the cellular network is regular in size,shape and distribution.This paper proposes a location management strategy based on irregular cellular network topology,including macro-cell,micro-cell and pico-cell.The terminal will compute the physical distance between the current cell and the last reported cell by regrouping neighbor cells and comparing the CCs (cell coordinates) which are broadcasted by each base station.In the paper a dynamic location update algorithm based on distance and direction angle is presented.Finally,the formula for the total cost of location management between two paging arrivals is deduced by a semi-Markov decision process.The numerical analysis shows that the total costs of location updating and paging of individuation sector location management scheme is superior to that of circle location cell when the mobile user moves frequently.

A Cooperative Location Management Scheme for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a kind of wireless ad hoc network. It is a self-configuring network of mobile routers connected by wireless links. Since MANETs do not have a fixed infrastructure, it is a chal-lenge to design a location management scheme that is both scalable and cost-efficient. In this paper, we propose a cooperative location management scheme, called CooLMS, for MANETs. CooLMS combines the strength of grid based location management and pointer forwarding strategy to achieve high scalability and low signaling cost. An indepth formal analysis of the location management cost of CooLMS is presented. In particular, the total location management cost of mobile nodes moving at variable velocity is estimated using the Gauss_Markov mobility model for the correlation of mobility velocities. Simulation results show CooLMS performs better than other schemes under certain circumstances.

Performance Analysis of Profile-Based Location Caching with Fixed Local Anchor for Next-Generation Wireless Networks

Although a lot of works for location management in wireless networks have been reported in the literature, most of the works have been focused on designing per-user-based strategies. This means that they can achieve the performance enhancement only for a certain class of mobile users with a specific range of CMR (call-to-mobility ratio). However, these per-user-based strategies can actually degrade the performance if a user's CMR changes significantly.Therefore, an efficient uniform location management strategy, which can be commonly applied to all mobile users regardless of their CMR, is proposed and analyzed in this paper. The motivation behind the proposed strategy is to exploit the concepts of the two well-known existing strategies: the location caching strategy and the local anchor strategy. That is, the location caching strategy exploits locality in a user's calling pattern, whereas the local anchor strategy exploits locality in a user's mobility pattern. By exploiting these characteristics of both strategies together with the profile management at the HLR (home location register), the proposed strategy can reduce the frequent access to the HLR, and thus effectively results in significant reduction in terms of the total location management cost. The analytical results also demonstrate that the proposed strategy can be uniformly applied to all mobile users, while always maintaining the performance gain over the IS-41 standard regardless of a user's CMR and the network traffic conditions.

Optimization of Distance-Based Location Management for PCS Networks

Location management (LM) is an important function in a personal communication network to track movements of mobile terminals (MTs) for call delivery. It is well-known that the total signaling cost of a distance-based LM scheme is the lowest among dynamic location management schemes for PCS networks. In this paper, we derive the joint probability distribution of two random variables: the moving distance of an MT and the number of location updates resulting from the moving distances exceeding the distance threshold. As special cases, the probability distributions of an MT's moving distances and the number of location updates during an LM interval are obtained. These statistics are generally applicable to irregular cell topologies and general cell residence time distributions. Based on the derived statistics, the optimal distance thresholds for distance based LM schemes with blanket paging and sequential paging are solved analytically. Numeric results show that our optimized distance-based LM scheme outperforms some well-known LM schemes in total LM cost.

Performance Evaluation of Stop & Wait and Reset & Wait Time-Based Location Update Strategies

In mobile communication systems, mobility tracking operations are executed to maintain known the whereabouts of each mobile terminal (MT). In this article, we propose and analyse two new versions of the original time-based registration method, namely the Stop and Wait (S&W) and the Reset and Wait (R&W) time-based strategies. We also propose and study the modified S&W and R&W schemes as a result of combining the S&W and RAW policies with the enhanced time-based method in [3]. When the MT uses one of the four schemes proposed, it sends less location update (LU) messages. As a result of fewer LUs, which results in less contacts with the network, the uncertainty of the MT position increases in the proposed time-based schemes. Although the MT paging (PG) cost is lightly increased, a significant reduction in the LU cost is achieved. As it is shown, the net effect is a saving in the total location management cost per call arrival. In order to analyse the four strategies and compare them with the original and enhanced time-based schemes, [3], a performance evaluation method based on Markovian standard tools is proposed here. The location management cost for all these time-based policies are evaluated analytically here by using this evaluation method.

Mobile User Tracking Using A Hybrid Neural Network

In this paper, a novel technique for location prediction of mobile users has been proposed, and a paging technique based on this predicted location is developed. As a mobile user always travels with a destination in mind, the movements of users, are, in general, preplanned, and are highly dependent on the individual characteristics. Hence, neural networks with its learning and generalization ability may act as a suitable tool to predict the location of a terminal provided it is trained appropriately by the personal mobility profile of individual user. For prediction, the performance of a multi-layer perceptron (MLP) network has been studied first. Next, to recognize the inherent clusters in the input data, and to process it accordingly, a hybrid network composed of a self-organizing feature map (SOFM) network followed by a number of MLP networks has been employed. Simulation studies show that the latter performs better for location management. This approach is free from all unrealistic assumptions about the movement of the users. It is applicable to any arbitrary cell architecture. It attempts to reduce the total location management cost and paging delay, in general.

Location management in cellular mobile computing systems with dynamic hierarchical location databases

An important issue in the design of a mobile computing system is how to manage the location information of mobile clients. In the existing commercial cellular mobile computing systems, a two-tier architecture is adopted. However, the two-tier architecture is not scalable. In the literatures, a hierarchical database structure is proposed in which the location information of mobile clients within a cell is managed by the location database responsible for the cell. The location databases of different cells are organized into a tree-like structure to facilitate the search of mobile clients. Although this architecture can distribute the updates and the searching workload amongst the location databases in the system, location update overheads can be very expensive when the mobility of clients is high. In this paper, we study the issues on how to generate location updates under the distance-based method for systems using hierarchical location databases. A cost-based method is proposed for calculating the optimal distance threshold with the objective to minimize the total location management cost. Furthermore, under the existing hierarchical location database scheme, the tree structure of the location databases is static. It cannot adapt to the changes in mobility patterns of mobile clients. This will affect the total location management cost in the system. In the second part of the paper, we present a reorganization strategy to restructure the hierarchical tree of location databases according to the mobility patterns of the clients with the objective to minimize the location management cost. Extensive simulation experiments have been performed to investigate the reorganization strategy when our location update generation method is applied.