• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2430-2437
• /
• 1999

This paper introduces an adaptive time-based location update scheme that dynamically determines when to perform location update based on moving distance of mobile station and incoming call arrival probability using fuzzy logic. Comparison with other schemes demonstrate that proposed scheme adapts well to the environment where the characteristics of mobility pattern of mobile station is changed all the time, and reveals better performance in the aspect of network signaling load.

• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1069-1074
• /
• 2022

IP mobility can be handled in different layers of the protocol. Mobile IP has been proposed to handle the mobility of Internet hosts in the network layer. Recently, a new method based on the SIGMA mobility architecture has been proposed to support mobility management with reduced packet loss and latency. The location management structure is not suitable for frequent mobile handover due to the high mobility of the user with this transport layer solution. In this paper, we propose a location management optimization method in a mobile communication network by applying hierarchical location management using MMPs(Mobility Management Points) for transport layer mobility management. Therefore, we propose an efficient hierarchical mobility management structure even between heterogeneous wireless networks using MMPs for the probability that a mobile terminal can change multiple location areas between two messages and calls. The proposed method shows reduction in location update cost and data retrieval cost using MMPs, and as opposed to mobility appearing in time intervals with the minimum cost required to reach 90% of the stabilized cost, the mobility location update search, location It was found that the message processing cost per area was reduced.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.21-27
• /
• 2003

Objective of this paper is to develop the user mobility model(UMM) which is used for the performance analysis of location update and paging algorithm and at the same time, consider the user mobility pattern(UMP) in zone-based cellular networks. User mobility pattern shows correlation in space and time. UMM should consider these correlations of UMP. K-dimensional Markov chain is presented as a UMM considering them where the states of Markov chain are defined as the current location area(LA) and the consecutive LAs visited in the path. Also, a new two dimensional Markov chain composed of current LA and time interval is presented. Simulation results show that the appropriate size of K in the former UMM is two and the latter UMM reflects the characteristic of UMP well and so is a good model for the analytic method to solve the performance of location update and paging algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.757-766
• /
• 2007

Location services are used in mobile ad hoc and hybrid networks to locate either the geographic position of a given node in the network or a data item. One of the main usages of position location services is presented in location based routing algorithms. In particular, geographic routing protocols can route messages more efficiently to their destinations based on the destination node's geographic position, which is provided by a location service. In this paper, we propose an adaptive location service on the basis of fuzzy logic called FHLS (Fuzzy Hierarchical Location Service) for mobile ad hoc networks. The adaptive location update scheme using the fuzzy logic on the basis of the mobility and the call preference of mobile nodes is used by the FHLS. The performance of the FHLS is to be evaluated by a simulation, and compared with that of existing HLS scheme.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.261-264
• /
• 2004

We propose a location management with adaptive binding idle lifetime scheme for IP-based wireless network. In our proposed scheme, the binding idle lifetime value is adaptively varied according to user characteristics. The main idea is that the mobile node (MN) does location update (LU) even in idle state. Furthermore a sequential paging scheme is used to reduce the paging cost. The proposed scheme can be used in both cellular network and IP-based network.

• 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).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.628-631
• /
• 2002

차세대 유무선 통신망은 IP기반으로 통합 발전될 것이라고 기대하고 있고, 현재 연구중인 Mobile IP는 필수적으로 사용하게 될 것이다. 문제점이 많은 기본 Mobile IP에 기존의 하위계층에서 사용하던 여러 가지 기술들을 추가하려고 노력하고 있는데, 그 중 대표적인 것이 위치등록과 페이징 기법이라고 할 수 있다. 본 논문은 3계층에서의 이동성 프로토콜인 Mobile IP에 기존의 2계층에서의 거리기반 위치등록 방법을 적용시켜 IP망에서의 효율적인 페이징 방안을 제시한다. 그리고, 네트워크 시뮬레이션 도구인 OPNET을 이용하여 제시한 방안을 구현하고 검증하였다.

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.23-35
• /
• 2009

This study deals with the location management in WCDMA (Wideband Code Division Multiple Access) networks. The new location management method is the one of the many techniques used to provide the packet switched (PS) services effectively in WCDMA networks. WCDMA introduces RA (routing area) for the PS services in addition to LA (location area) for the circuit switched (CS) services. WCDMA system also adopts the cooperative paging and the combined area update which are to decrease signaling traffic using the PS network resources for the CS services. Considering the characteristics of the WCDMA networks, this study formulate into the mathematical programming problem for the location management. Rather than the existing researches which consider the single MSC/SGSN networks, we deal with the multi MSC/SGSN networks, where both MSC area and SGSN area should be determined as well. Fairness between traffic loads of MSC/SGSN and the system cost incurred to MSC/SGSN are also incorporated into our model, which make the model more realistic. We propose greedy algorithms for the problems, which consists of the merger of two neighboring areas and the movement of an area. Extensive experiment has been done based on the realistic problem examples. Followed by the analysis of parameter effect on the final solutions and the quality of final solutions obtained by our greedy algorithms. Our proposed model and analysis result can be used to determine WCDMA system areas and to predict the system performance measures by the determination.

• 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.