• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1135-1144
• /
• 1999

본 논문에서 우리는 셀룰러 통신 시스템을 위한 위치갱신과 위치질의 비용을 줄일 수 있는 새로운 위치관리 기법을 제안한다. 위치갱신 및 위치질의 비용을 줄이기 위하여, 제안한 위치관리 기법은 사용자 지역성을 사용한다. 사용자 지역성은 이동 지역성과 호 지역성으로 이루어진다. 이동 지역성을 갖는 이동단말들을 위한 위치갱신은 지역 PVLR(Proxy-Visitor Location Register) 갱신에 의해 위치갱신 비용을 줄일 수 있다. 호 지역성을 갖는 이동단말들을 위한 위치질의는 지역 PVLR 질의에 의해 위치질의 비용을 줄일 수 있다. 분석 모델을 통하여, 제안한 기법의 성능 분석과 IS-41 표준과 제안 기법과의 성능을 비교한다. 사용된 비교 척도는 네트워크 비용, 데이타베이스 비용 그리고 호 설정 지연이다. 이들 모든 척도들에 대해서, 제안 기법이 IS-41 표준에서 정의된 위치관리 기법보다 더 좋은 성능을 보인다. 또한 비교 결과는 CMR(Call-to-Mobility Ratio)에 상관없이 제안 기법이 IS-41 기법보다 성능이 좋음을 보여준다. Abstract In this paper, we propose a new location management scheme for cellular communication systems with the goal of reducing both location update and query cost. In order to reduce both location update and query cost, the proposed scheme uses user locality. User locality consists of movement and call locality. For mobile terminals with movement locality, location update cost is reduced by local PVLR(Proxy-Visitor Location Register) update. Location query cost is reduced by local PVLR query for mobile terminals with call locality. Through analytical models, we analyze the performance of the proposed scheme and compare it with that of the IS-41 scheme. The measures of comparison used are the network cost, the database cost, and the call set up delay. For all these measures, the proposed scheme performs better than the location management scheme defined in the IS-41 standard. Result comparison also shows that the our scheme performs better than the IS-41 scheme, regardless of CMR(Call-to-Mobility Ratio).

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

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.381-388
• /
• 2003

Location tracking is used to keep track of the location information of a mobile terminal in an idle state for a cail setup between mobile terminals. In this paper, we introduce a location update algorithm based on the call arrival history, which is appropriate for a variable call arrival rate over time. The location tracking strategy which uses the proposed algorithm can find changes in the call arrival rate by maintaining a call arrival history of a mobile terminal, from which a mobile terminal can calculate an appropriate timeout interval for a variable call arrival rate. We show that the proposed scheme is appropriate for a variable call arrival rate by presenting a simple analytical model and analytical results to investigate its performance for both a fixed and a variable call arrival rate.

• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.73-80
• /
• 2008

The location area planning is to assign cells to the location areas of a wireless communication network in an optimum manner. The two important cost components are cost of location update and cost of paging that are of conflicting in nature; i.e., minimizing the registration cost might increase the search cost. 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. In fact this is shown to be an NP-complete problem in an earlier study. In this paper, we use an ant colony optimization method to obtain the best/optimal group of cells for a given a network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.573-587
• /
• 2003

Due to the growth of mobile communication and the popularization of Internet, it is expected that wired and wireless communication network of the next generation will be integrated and flourished with IP-based. There have been a great deal of research efforts to provide mobile IP service onthe existing lower layer. The location update and the paging scheme is one of the most challenging technical issues for this topic. In this thesis, a paging method based on the distance-based location update scheme is proposed for IP network to support mobility in layer 3. The proposed scheme is implemented and verified with the OPNET.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.48-64
• /
• 2003

Recently, as the number of mobile users keeps increasing explosively, the location management to track the mobile users in mobile communication systems is being more important. However, the previous location management schemes have been used static location information without the consideration of a user's moving direction. This results in unnecessary pagings, consequently it increases location management costs. In this paper, we propose a mew location management costs. In this paper, we propose a new location the cell occurred a location update. It also determines whether the location update will be executed or not, by the offset operation of direction vector. Thus, a user's paging areas are generated dynamically along the user's moving direction. The wide of paging areas is also determined dynamically. Besides, we present analytic model for our scheme. To compare with our scheme, the distance-based scheme is analyzed. The numerical result shows that our scheme is more efficient than the distance-based scheme in the most cases except a low CMR. Particularly if a user move into a specific direction, our scheme has the lower location management cost than that of the distance-based scheme.

• Journal of Industrial Technology
• /
• v.27 no.A
• /
• pp.141-147
• /
• 2007

In this paper, we define the multi-states exponential cell resident time mobility model for describing the mobility characteristics of mobile user and analyzed the total cost of the hybrid method using multi-states cell resident time. Generally, the mobile user has three states for its movement, such as staying, walking and driving. This multi-states cell resident time based hybrid method reflects the movement characteristics of mobile user and adapts the location update period according to the states of mobility speed. As a results of the performance analysis, we can get the optimum parameters of the hybrid method for multi-states based mobile users.

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

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.677-682
• /
• 2001

In a microcell environment having frequent inter-cell movement of a subscriber, the amount of signalling traffic rapidly increases due to the treatment of location update and other necessary actions. As a way to reduce such an overhead, this paper presents an algorithm that dynamically allocates subscribers paging and location areas each of which has a different size and shape, depending on the characteristics of subscriber mobility. Mathematical analysis results show that this algorithm allows reduced area management cost, compared to conventional algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1217-1224
• /
• 1999

이동 호스트들의 위치 정보를 관리하는 것은 이동 컴퓨터 시스템에서 중요한 문제이다. 이동 호스트가 이동할 때 위치 수정과 위치 탐색간에는 상반관계가 존재한다. 본 논문에서는 위치 서버를 이용한 간단한 quorum 기반 분산 동적 위치 관리 방법을 제안한다. 이 방법에서는 이동 호스트들의 위치 정보가 모든 위치 레지스터가 아닌 위치 레지스터들의 부분집합에서 효율적으로 관리되기 때문에 위치 수정 비용과 위치 탐색 비용이 감소된다. 그리고 위치 레지스터들의 부분집합은 동적으로 변하고, 각 위치 서버의 부하는 이동 호스트에 대한 질의율을 고려하므로 균등해진다. 제안된 알고리즘의 성능은 위치 수정비용과 위치 탐색비용의 전체비용으로 평가되었고, Prakash의 알고리즘과 비교되었다.Abstract Managing location information of mobile hosts is an important issue in mobile computing systems. There is a trade-off between location update and search, when a mobile host moves. This paper proposes a simple quorum-based distributed dynamic location management method using location registers. The cost of location updates and searches is reduced by our method because the location information of mobile hosts is managed efficiently in a subset of location registers instead of in all location registers. In our method, the subset of location registers is dynamically changed, and the load of each location register is balanced by considering query rate for mobile hosts. The performance of proposed algorithm is evaluated in terms of the total cost of a location update and a location search, and is compared with Prakash's algorithm.