• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.115-121
• /
• 2007

Recently, Location Based Service including tracking and way-finding services has been activated rapidly in the ubiquitous computing environment. According as the ubiquitous computing environment is developed, various types of sensor to acquire various data including location of the moving object are used widely, and acquired sensor data becomes abundant. However, the existing location management system based on a single location sensor is difficult to support LBS efficiently in the ubiquitous computing environment. In this paper, therefore, we propose the location management system in the ubiquitous computing environment that can manage the location data and the various sensor data efficiently. In addition, the location management system adopts the core technology for efficiently storing and transferring a large-volume of various data such as location data and for efficiently processing the various requests from a variety of servers and sensors. Especially, our architecture that is presented in this paper can support context-aware services and autonomous services efficiently in the ubiquitous computing environment.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.153-163
• /
• 2013

In recent years, more and more researches have been focusing on trust management of vehicle ad-hoc networks (VANETs) for improving the safety of vehicles. However, in these researches, little attention has been paid to the location privacy due to the natural conflict between trust and anonymity, which is the basic protection of privacy. Although traffic safety remains the most crucial issue in VANETs, location privacy can be just as important for drivers, and neither can be ignored. In this paper, we propose a beacon-based trust management system, called BTM, that aims to thwart internal attackers from sending false messages in privacy-enhanced VANETs. To evaluate the reliability and performance of the proposed system, we conducted a set of simulations under alteration attacks, bogus message attacks, and message suppression attacks. The simulation results show that the proposed system is highly resilient to adversarial attacks, whether it is under a fixed silent period or random silent period location privacy-enhancement scheme.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.388-394
• /
• 2007

In wireless network, we propose a predictive location update scheme which considers mobile user's(MU's) mobility patterns. MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

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

• Health Policy and Management
• /
• v.9 no.3
• /
• pp.21-32
• /
• 1999

The purpose of this study is to assess individual decisive factors for distribution of medical specialists in Korea. A data set was constructed using several published data sources. including the Korean Medical Association's physician master file as a principal source for physician information. Linear logistic regression analysis was performed to assess the relationship between the location of private specialist clinic for practice with six variables related with individual characteristics: age. sex. location of postgraduate training hospital. location of medical school graduated, size of hospital for training, and specialty. Analysis showed that location of practice. classified into urban and rural areas, was significantly associated with the variables of sex. location of postgraduate training hospital. location of medical school. In addition, significant association was found between the location of practice which was categorized into "near-Seoul area" and others, and sex, location of postgraduate training hospital. and location of medical school. We could conclude that to improve area maldistribution of physicians locations of hospitals for training and medical schools have to have the highest priority in the policymaking.icymaking.

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

• Journal of Digital Contents Society
• /
• v.11 no.4
• /
• pp.433-443
• /
• 2010

In this paper, we provide a comprehensive overview and classification on a wide range of the existing location management schemes which have been reported for wireless cellular networks and Mobile IP-based networks, respectively. In addition, from the various previous literature, we derive common key conceptual techniques, their main design goals and performance considerations on them, which can provide a useful guidance for understanding location management schemes regardless of network types. The aim of this paper is not to propose a new scheme for location management, but to highlight the various key design features involved in the design of the existing location management schemes, and to enhance an insight into the fundamental principles and techniques for designing more efficient and optimized location management scheme in future wireless mobile networks. We expect that regardless of network types, these underlying fundamental principles and conceptual techniques could be also easily tailored for more efficient mobility/QoS support in future mobile computing environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.473-476
• /
• 2008

USN(Ubiquotous Sensor Network) has been applied to various fields of industries such as logistics, environment management, traffic management, as well as IT industries including home network and telematics. Among the important techniques required to implement aforementioned applications, location management scheme is essential. In this paper, we proposed and implemented a new location measurement scheme based on RSSI of sensor node for campus car location management.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.11a
• /
• pp.185-202
• /
• 2004

Recent development in wireless computing and GPS technology cause the active development in the application system of location information in real-time environment such as transportation vehicle management, air traffic control and location based system. Especially, study about vehicle location tracking system, which monitors the vehicle's position in a control center, is appeared to be a representative application system. However, the current vehicle location tracking system can not provide vehicle position information that is not stored in a database at a specific time to users. We designed a vehicle location tracking system that could track vehicle location using mobile interface such as PDA. The proposed system consist of a vehicle location retrieving server and a mobile interface. It is provide not only the moving vehicle's current location but also the position at a past and future time which is not stored in database for users.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.4
• /
• pp.139-155
• /
• 2006

The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm' is able to find the best solution than the other two algorithms in a relatively short computational time.