• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.55-61
• /
• 2005

In this paper we propose a distributed location management scheme to reduce the bottleneck problem of HLR in Large Mobile Networks (LMN). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small mobile networks. Then, we extend the scheme in a hierarchical environment to reduce the overhead traffic and scale to LMN. In numerical results, we show the superiority of our scheme compared to the current IS-95 standard scheme in IMT-2000 networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.6
• /
• pp.77-82
• /
• 2012

In this paper, the new location management scheme based on region and movement threshold has been proposed in order to minimize the required cost to handle the resource location management signaling traffics under the wire/wireless convergent networks when the users are moving around the cold and hot regions. In this scheme, the sequential paging is supposed to be performed according to the movement threshold which can be changed in accordance with the number of movements that each mobile user had made while it is moving around the resource regions. With the proposed scheme, the cost of managing the location management traffics and efficient spectrum assignment overhead can be minimized by placing signaling traffics for location managements and also allocating radio spectrum considering individual movement behaviors.

• Journal of the Korea Safety Management & Science
• /
• v.17 no.4
• /
• pp.287-295
• /
• 2015

modern logistics are required to carry out functions such as timely adjustment and swift adaptation to changing patterns, and this leads to the emphasis on forming logistics parks. Logistics parks make profits using the efficiency of time and space. Such logistics parks play an important role in a corporation creating operating profits as well as acting as a method of alternative investment for individuals. Logistics parks no longer simply store materials, but have become a place that plays an important role in various areas of corporate and individual activities, and thus the analysis of the selection of the location of logistics parks and the related characteristics is extremely important. There are many existing studies on the selection of locations of logistics parks but work on the factors related to location selection by industry seem lacking. As such, in the course of this study we have used preceeding studies to draft a questionnaire on which selection factors affect the selection of logistics park location in different industries and conducted empirical analysis of the questionnaire results to uncover the factors that affect the selection of the locations of logistics parks in different industries.

• The KIPS Transactions:PartD
• /
• v.8D no.2
• /
• pp.105-116
• /
• 2001

Moving objects are spatiotemporal data that location and shape of spatial objects are changed continuously over time. If spatiotemporal moving objects are managed by conventional database system, moving objects management systems have two problems as follows. First, update for location information changed over time is occurred frequently. Second, past and future information of moving objects are not provided by system because only current state of objects is stored in the system. Therefore, in this paper, we propose a spatiotemporal moving objects management system which is able to not only manage historical information of moving objects without frequent update, but also provide all location information about past, current, and near future. In the proposed system, information of moving objects are divided into location information for representing location and motion information for representing moving habits. Especially, we propose the method which can search location information all objects by use of changing process algorithms with minimum history information. Finally, we applied the proposed method to battlefield analysis system, as the result of experiment, we knew that past, current, and near future location information for moving objects are managed by relational database and GIS system.

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

• Journal of Advanced Navigation Technology
• /
• v.15 no.5
• /
• pp.742-748
• /
• 2011

G-File on the position of the photo shoot pictures with built-in picture file to the user, the location and orientation of the image files using the data refers to the [1]. G-File is to store photo files, photo files and receiving means for receiving input, and picture files, photos and location information extracted by separating the subject's location information with location information and location analysis by means of the corresponding coordinates on the map including the location indicated in the guide means is characterized in that. In this paper, the G-File on the location information stored in the algorithm that can be managed is proposed. G-File on the algorithm used to manage the information to the user, G-File management is to provide convenience.

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

• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.21-37
• /
• 1995

This paper suggests a procedure of decomposing a multi-stage dynamic location problem into stages with respect stage. The problem can be formulated as a mixed integer programming problem, which is difficult to be solved directly. We perform a series of transformations in order to divide the problem into stages. In the process, the assumption of PSO (production-system-only) plays a critical role. The resulting subproblem becomes a typical single-stage dynamic location problem, whose efficient algorithms have been developed efficiently. An extension of this study is to find a method to integrate the solutions of subproblems for a final solution of the problem.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.63-75
• /
• 1995

The uncapacitated facility location problem considered here is to determine facility location sites, minimizing the total cost of establishing facilities and serving customer demand points which require primary and back-up services. To solve this problem effectively, we propose two things in this study. First, we propose an idea of Benders' decomposition approach as a solution method of the problem. Second, we implement the problem on GAMS. Using GAMS (general Algebraic Modeling System) can utilize an mixed-integer programming solver such as ZOOM/XMP and provide a completely general automated implementation with a proposed solution method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.8 no.1
• /
• pp.27-30
• /
• 1983

The purpose of this paper is to find a new method for the warehouse location problem. Akinc and Khumatvala developed a branch and bound algorithm for a one-stage problem, that is, plants and warehouses are at the same location. This paper extends this method to a two-stage problem, that is, plants, warehouses and users are located at different sites, and further this paper allows direct flows from plants to users. The new method is tested at Perkins-Elmer. The test shows that the algorithm is efficient.