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

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.276-279
• /
• 2004

The location-based service is one of the most powerful services in the mobile area. The location-based service provides information service for moving user's location information and information service using wire / wireless communication. In this paper, we propose a model for personalized recommendation system which includes location information and personalized recommendation system for location-based service. For this service system, we consider mobile clients that have a limited resource and low bandwidth. Because it is difficult to input the words at mobile device, we must deliberate it when we design the interface of system. We design and implement the personalized recommendation system for location-based services(advertisement, discount news, and event information) that support user's needs and location information. As a result, it can be used to design the other location-based service systems related to user's location information in mobile environment. In this case, we need to establish formal definition of moving objects and their temporal pattern.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.25-28
• /
• 1999

Consider connection-oriented wireless cellular net-works. To establish a circuit or virtual circuit in such a network, a paging message is broadcast over a region at which the destined mobile station is presumed to reside, (identified as a paging area). For an effective paging mechanism, it is desirable to provide the location information of mobile stations to the network. In this paper, we consider a mobile controlled location update scheme under which each mobile station periodically reports its current location information to the network by using an inherent timer (without measuring the power of signals transmitted from base stations). Based on the latest information about a mobile station's location, a paging area is selected to page the mobile station. Note that under this scheme, a mobile station may not yet have reported its location change while sojourning out of the current paging area. In such situation, the mobile station can not receive a paging message destined to it. Frequent location updates can reduce the paging failure rate incurred by mobile stations'sojourning out of the paging area. However, larger bandwidth is needed for location update as the location update rate is increased. On the other hand, as the size of the paging area is increased, the paging failure rate is decreased, while larger bandwidth is required for paging. Thus, we first present a model for mobility, paging and location update processes, and secondly investigate the effect of network parameters on the paging failure rate and the amount of bandwidth used for paging and location update. Finally, we formulate problems to find proper values for the location update rate and paging area size under the constraints on the bandwidth usage levels for location update and paging.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.119-135
• /
• 2005

Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

• Journal of Distribution Science
• /
• v.17 no.6
• /
• pp.77-84
• /
• 2019

Purpose - Although an extensive body of research in psychology and marketing focuses on perceived waiting time, no research has examined the effect of the location of the waiting place on perceived waiting time. In particular, this study suggests that customers who are waiting in a restaurant may have different perceived waiting time depending on whether they are in close proximity to the service area (e.g., dining area) or farther from it. In particular, the author examines how and why the location of the waiting place affects the perceived waiting time of the consumer and reveals the mental simulation as its psychological mechanism. Research design, data, and methodology - This study conducted field surveys with customers waiting in real restaurants. Eighty-eight people participated under two conditions: a restaurant with a waiting place near the dining area and a restaurant with a waiting place far from the dining area. Participants responded to questions about perceived waiting time (the dependent variable), mental simulation (the mediator), and demographic variables. To verify the hypothesis, ANOVA and bootstrapping analysis were performed. Results - The major results from the field study are as follows. First, participants perceived wait time differently depending on the location of the restaurant's waiting place: participants in the restaurant with a waiting place close to the dining area perceived significantly shorter waiting times. Second, the effect of the location of the waiting place on the perceived waiting time was mediated by mental simulation: the closer the wait location is to the dining area, the more imagination the customer exercises about the meal, which in turn distracts attention from time flow and shortens the perceived wait time. Conclusion - This study has a theoretical implication in that it extends research on perceived waiting time as the first study of how and why the location of a waiting place affects a customer's perceived waiting time. It has a practical implication that can be used as a marketing tactics to improve the image of the service provider by changing the location of the waiting place.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.10
• /
• pp.3438-3457
• /
• 2022

As location-based services (LBS) are widely used in vehicular ad-hoc networks (VANETs), location privacy has become an utmost concern. Spatial cloaking is a popular location privacy protection approach, which uses a cloaking area containing k-1 collaborative vehicles (CVs) to replace the real location of the requested vehicle (RV). However, all CVs are assumed as honest in k-anonymity, and thus giving opportunities for dishonest CVs to submit false location information during the cloaking area construction. Attackers could exploit dishonest CVs' false location information to speculate the real location of RV. To suppress this threat, an edge-assisted Trusted Collaborative Anonymity construction scheme called TCA is proposed with trust mechanism. From the design idea of trusted observations within variable radius r, the trust value is not only utilized to select honest CVs to construct a cloaking area by restricting r's search range but also used to verify false location information from dishonest CVs. In order to obtain the variable radius r of searching CVs, a multiple linear regression model is established based on the privacy level and service quality of RV. By using the above approaches, the trust relationship among vehicles can be predicted, and the most suitable CVs can be selected according to RV's preference, so as to construct the trusted cloaking area. Moreover, to deal with the massive trust value calculation brought by large quantities of LBS requests, edge computing is employed during the trust evaluation. The performance analysis indicates that the malicious response of TCA is only 22% of the collaborative anonymity construction scheme without trust mechanism, and the location privacy leakage is about 32% of the traditional Enhanced Location Privacy Preserving (ELPP) scheme.

• Journal of information and communication convergence engineering
• /
• v.3 no.2
• /
• pp.80-83
• /
• 2005

At present, GML becomes the global standard for the XML encoding of geographic information and is the foundation for the Geo-Web. GML is being applied to a wide range of geographic applications including GIS and location-based services, telematics and intelligent transportation systems. In this paper, we propose the tourism information system for supporting the location based service application. We made an effort to design and implement a GIS computing environment by thin client for mobile web mapping service. We are interested in the GML applications that include traditional GIS system for navigation service and location finder for points of interest (POI) services. This paper summarizes the Tourism information system for location based service of a small area (Han-Ok Village with the Korean traditional houses in Jeonju-city), in which moving travelers can obtain proper information services at the current location associated with traditional monuments, cultural products, food, and conveniences. In the paper, we report on the design of the thin client/server system for a mobile environment. This paper is divided into three parts. First, we give a general overview of the organization of the system and of the important concerns of our design. Second we focus on our system supports for location and POI determination, and design concerns. Finally, we show the graphic user interface of PDA, the procedures involved in the service, and the executed results.

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

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.289-297
• /
• 2004

State-of-the-art wireless communication networks allow dynamic relocation of mobile terminals. A location management mechanism is required to keep track of a mobile terminal for delivering incoming calls. In this paper, we propose a fuzzy logic-based selective paging method to reduce paging cost. In the proposed fuzzy logic-based location management method, the location update uses the area-based method that uses direction-based together with movement-based methods, and the location search uses the fuzzy logic-based selective paging method based on the mobility information of mobile terminals. A partial candidate paging area is selected by fuzzy control rules, then the fuzzy logic-based selective paging method pages only the cells within the partial candidate paging area. The performance of proposed fuzzy logic-based location management method is to be evaluated by both an analytical model and a simulation, and is compared with those of LA and BVP methods. From these evaluation results, we know that the proposed fuzzy logic-based location management method provide better performance than other location management methods.

• Journal of Korea Planning Association
• /
• v.54 no.5
• /
• pp.76-90
• /
• 2019

The purpose of this study is to analyze the survival characteristics of the restaurant business by trade area type (major and side street). By the increase of the unemployment rate, the new foundation of selt-employment type is increasing. However, due to high competition and economic recession, the sustainability of new foundation is not high. Therefore, in this study, survival analysis was performed considering the individual and commercial characteristics focused on the ordinary restaurants. The major findings are as follow. First, the characteristics of parcel unit and adjacent area have a significant effect on the survival. This means the micro-scopic spatial characteristics should be considered for survival in the location choice. Second, the regional economic characteristics in trade area have a significant effect on survival. Furthermore, these characteristics are different by the trade area type. Third. the development characteristics have a different effect on survival by the building usage and trade area type. Finally, regional economic characteristics have a significant effect on survival. These results are expected to be used as basic data for commercial location selection and trade area analysis system in the private and public sectors.