• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.17-22
• /
• 2005

Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

• Korean Management Science Review
• /
• v.29 no.1
• /
• pp.143-152
• /
• 2012

Location area planning (LAP) problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost in location management. The minimum cost has two components namely location update cost and searching cost. Location update cost is incurred when the user changes itself from one location area to another in the network. The searching cost incurred when a call arrives, the search is done only in the location area to find the user. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use particle swarm optimization (PSO) to obtain the best/optimal group of cells for 16, 36, 49, and 64 cells network. Experimental studies illustrate that PSO is more efficient and surpasses those of precious studies for these benchmarking problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.964-974
• /
• 2003

With increasing use of a personal mobile computer. the Mobile IPv6 is one of the main protocols that support mobility and complies with IPv6 specification. Similar to the mobile IPv6, the mobile IPv6 also has limitations on fast moving condition. The Hierarchical Mobile IPv6 is a solution that overcomes these limitations. The Hierarchical Mobile IPv6 is a micro mobility protocol that supports fast mobile IP handover and reduces signaling overhead with Mobility Anchor Point(MAP). But until now no paging method is applied to the Hierarchical Mobile IPv6 to reduce unnecessary signaling overhead and power consumption of mobile nodes. So, the paging mechanism for the Hierarchical Mobile IPv6 is proposed in this paper. the mechanism is implemented by making use of the destination option header and extension function and the last location algorithm. The results show that the Hierarchical Mobile IPv6 with the paging ability reduces the traffic of mobile networks by removing unnecessary binding update packet generated whenever handover takes place. Also, the larger the paging size is. the less the number of BU(Binding Update) massage generated.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.1-6
• /
• 2020

Fast service access involves keeping track of the location of mobile users, while they are moving around the mobile network for a satisfactory level of QoS (Quality of Service) in a cost-effective manner. The location databases are used to keep track of Mobile Terminals (MT) so that incoming calls can be directed to requested mobile terminals at all times. MT reporting cell system used in location management is to designate each cell in the network as a reporting cell or a non-reporting cell. Determination of an optimal number of reporting cells (or reporting cell configuration) for a given network is reporting cell planning (RCP) problem. This is a difficult combinatorial optimization problem which has an exponential complexity. We can see that a cell in a network is either a reporting cell or a non-reporting cell. Hence, for a given network with N cells, the number of possible solutions is 2^N. We propose a biogeography based optimization (BBO) for design of mobile station location management system in wireless communication network. The number and locations of reporting cells should be determined to balance the registration for location update and paging operations for search the mobile stations to minimize the cost of system. Experimental results show that our proposed BBO is a fairly effective and competitive approach with respect to solution quality for optimally designing location management system because BBO is suitable for combinatorial optimization and multi-functional problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.1999-2007
• /
• 2010

Proxy Mobile IPv6(PMIPv6) is a network-based mobility management protocol and it does not require mobile node's involving in mobility management. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. It may cause excessive signaling traffic and increase a high traffic load on LMA. Therefore, we propose a new mobility management scheme in proxy mobile IPv6 networks with dynamic paging support. To minimize signaling overhead, in our proposal, the size of the paging area is determined dynamically according the changes of mobility and traffic patterns of the mobile node. An analytic model is applied to determine the optimal size of the paging area. The cost analysis using fluid flow model presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.6
• /
• pp.123-132
• /
• 2005

There are many research results for the location update cost minimization of location management in cellular networks. For minimizing the location update cost, we have to take in consideration of each users' mobility pattern. This paper suggests location area list generation and a 3-step paging method based on users' movement history with the users' profiles. Users' mobility has not only geographical regular patterns but also time-related regularity. So, the method extracts users' movement regularities in both geography and time from their movement history, and generate location area list considering the regularities. For the performance analysis of the suggested method, we have executed a simulation for suggested method with user's mobility model. The results of the simulation show that suggested algorithm has some merits in the location management cost.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1309-1314
• /
• 2007

The assignment of cells to reporting or non-reporting cells is an NP-hard problem having an exponential complexity in the Reporting Cell Location Management (RCLM) system. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. T1is paper compares Max-Min ant system (MMAS), rank-based ant system (RAS) and hybrid method of MMAS and RAS that generally used to solve combinatorial optimization problems. Experimental results demonstrate that hybrid method of MMAS and RAS is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.661-663
• /
• 2002

This paper introduces a dynamic location management with hierarchical location area, which helps in reducing location update(LU) and paging cost and hence total location management cost. Users are assigned to appropriate location area level utilizing the call-to-mobility ratio(CMR) value. CMR values are calculated each time a user enters a new cell by computing its mobility rate and incoming call rate, which are the two key factors for defining the size of the location area.

• Korean Management Science Review
• /
• v.28 no.2
• /
• pp.53-62
• /
• 2011

The objective of this paper is to propose a Binary Particle Swarm Optimization(BPSO) for design of reporting cell management system. The assignment of cells to reporting or non-reporting cells is an NP-complete problem having an exponential complexity in the Reporting Cell Location Management(RCLM) system. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration(location update) and search(paging) operations to minimize the cost of RCLM system. Experimental results demonstrate that BPSO is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.