• The Journal of the Korea Contents Association
• /
• v.17 no.8
• /
• pp.619-630
• /
• 2017

With the growing popularity of smart devices, various location based services have been providing to users. Recently, some location based social applications that combine social services and location based services have been emerged. The demands of a k-nearest neighbors(k-NN) query which finds k closest locations from a user location are increased in the location based social network services. In this paper, we propose an approximate k-NN query processing method for fast response time in a large number of users environments. The proposed method performs efficient stream processing using big data distributed processing technologies. In this paper, we also propose a modified grid index method for indexing a large amount of location data. The proposed query processing method first retrieves the related cells by considering a user movement. By doing so, it can make an approximate k results set. In order to show the superiority of the proposed method, we conduct various performance evaluations with the existing method.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.1
• /
• pp.217-224
• /
• 2012

Location-Based Services(LBS) is a service that provide location information by using communication network or satellite signal. In order to provide LBS precisely and efficiently, we studied how we can reduce the error on location determination of objects such people and things. We focus on using the least square method and triangulation positioning method to improves the accuracy of the existing location determination method. Above two methods is useful if the distance between the AP and the tags can be find. Though there are a variety of ways to find the distance between the AP and tags, least squares and triangulation positioning method are wildely used. In this thesis, positioning method is composed of preprocessing and calculation of location coordinate and detail of methodology in each stage is explained. The distance between tag and AP is adjusted in the preprocessing stage then we utilize least square method and triangulation positioning method to calculate tag coordinate. In order to confirm the performance of suggested method, we developed the test program for location determination with Labview2010. According to test result, triangulation positioning method showed up loss error than least square method by 38% and also error reduction was obtained through adjustment process and filtering process. It is necessary to study how to reduce error by using additional filtering method and sensor addition in the future and also how to improve the accuracy of location determination at the boundary location between indoor and outdoor and mobile tag.

• 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 the Korea Academia-Industrial cooperation Society
• /
• v.18 no.3
• /
• pp.327-332
• /
• 2017

As Internet of Things (IoT) technology advances, there is a growing demand for location-based services (LBSs) to identify users' mobility and identity. The initial LBS system was mainly used to measure position information by measuring the phase of a signal transmitted from a global positioning system (GPS) satellite or by measuring distance to a satellite by tracking the code of a carrier signal. However, the use of GPS satellites is ineffective, because it is difficult to receive satellite signals indoors. Therefore, research on wireless communications systems like ultra-wide band (UWB), radio frequency identification (RFID), and ZigBee are being actively pursued for location recognition technology that can be utilized in an indoor environment. In this paper, we propose an LBS system that includes the 2.45GHz band for chirp spread spectrum (CSS), and the 3.1-10.6GHz band and the 250-750MHz bands for UWB using the IEEE 802.15.4a standard for low power-based location recognition. As a result, we confirmed that the 2.45GHz Industrial, Scientific and Medical (ISM) band RF transceiver and the ranging function can be realized in the hardware and has 0dBm output power.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.151-161
• /
• 2009

In Location-Based Services (LBSs), users requesting a location-based query send their exact location to a database server and thus the location information of the users can be misused by adversaries. Therefore, a privacy protection method is required for using LBS in a safe way. In this paper, we propose a new cloaking region generation algorithm using grids for privacy protection in LBSs. The proposed algorithm creates a m inimum cloaking region by finding L buildings and then performs K-anonymity to search K users. For this, we make use of not only a grid-based index structure, but also an efficient pruning techniques. Finally, we show from a performance analysis that our cloaking region generation algorithm outperforms the existing algorithm in term of the size of cloaking region.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.12
• /
• pp.1883-1890
• /
• 2013

Location detection technology (LDT) is one of the core techniques for location based service (LBS) in wireless communication for improving resource management and quality of services. The location of a mobile station (MS) is estimated using the time of arrival (TOA) technique based on three circles with centers corresponding to coordinates of three base stations (BSs) and radius corresponding to distances between MS and BSs. For accurately estimating the location of MS, three circles should meet at a point for the trilateration method, but they generally do not meet a point because the radius is increased depending on the number of time delay for estimating the distance between MS and BS and the carrier frequency. The increased three circles intersect at six points and the three intersection points among them should be generally placed close to coordinate of the location for the specific MS. In this paper, we propose the shortest distance algorithm for TOA trilateration method, to select three interior intersection points from entire six points. The proposed approach selects three intersection points with the shortest distances between coordinates of MS and intersection points and determines the averaged coordinate of the selected three points, as the location of the specific MS. We demonstrate the performance of the proposed algorithm using a typical computer simulation example.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.843-845
• /
• 2003

Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time locationbased service (LBS) environments according to user’s route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. There are major two kinds of cost parameters in route planning. One is static cost parameter which can be pre-computed such as distance and number of traffic-lane. The other is dynamic cost parameter which can be computed in run-time such as number of turns and risk of congestion. In this paper, we propose a new cost modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification. In addition to, describing the details of our shortest path algorithms, we present a location-based service system by using proposed routing algorithms.

• Asia pacific journal of information systems
• /
• v.24 no.3
• /
• pp.299-323
• /
• 2014

The reason location based service is drawing attention recently is because smart phones are being supplied increasingly. Smart phone, basically equipped with GPS that can identify location information, has the advantage that it can provide contents and services suitable for the user by identifying user location accurately. Offering such diverse advantages, location based services are increasingly used. In addition, for use of location based services, release of user's personal information and location data is essentially required. Regarding personal information and location data, in addition to IT companies, general companies also are conducting various profitable businesses and sales activities based on personal information, and in particular, personal location data, comprehending high value of use among personal information, are drawing high attentions. Increase in demand of personal information is raising the risk of personal information infringement, and infringements of personal location data also are increasing in frequency and degree. Therefore, infringements of personal information should be minimized through user's action and efforts to reinforce security along with Act on the Protection of Personal Information and Act on the Protection of Location Information. This study aimed to improve the importance of personal information privacy by empirically analyzing the effect of perceived values on the intention to strengthen location information security and continuously use location information for users who received location-based services (LBS) in mobile environments with the privacy calculation model of benefits and risks as a theoretical background. This study regarded situation-based provision, the benefit which users perceived while using location-based services, and the risk related to personal location information, a risk which occurs while using services, as independent variables and investigated the perceived values of the two variables. It also examined whether there were efforts to reduce risks related to personal location information according to the values of location- based services, which consumers perceived through the intention to strengthen security. Furthermore, it presented a study model which intended to investigate the effect of perceived values and intention of strengthening security on the continuous use of location-based services. A survey was conducted for three hundred ten users who had received location-based services via their smartphones to verify study hypotheses. Three hundred four questionnaires except problematic ones were collected. The hypotheses were verified, using a statistical method and a logical basis was presented. An empirical analysis was made on the data collected through the survey with SPSS 12.0 and SmartPLS 2.0 to verify respondents' demographic characteristics, an exploratory factor analysis and the appropriateness of the study model. As a result, it was shown that the users who had received location-based services were significantly influenced by the perceived value of their benefits, but risk related to location information did not have an effect on consumers' perceived values. Even though users perceived the risk related to personal location information while using services, it was viewed that users' perceived value had nothing to do with the use of location-based services. However, it was shown that users significantly responded to the intention of strengthening security in relation to location information risks and tended to use services continuously, strengthening positive efforts for security when their perceived values were high.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.67-79
• /
• 2007

Recently, to support LBS(location-based services) and telematics applications efficiently, there have been many researches which consider the spatial network instead of Euclidean space. However, existing range query and k-nearest neighbor query algorithms show a linear decrease in performance as the value of radius and k is increased. In this paper, to increase the performance of query processing algorithm, we propose materialization-based range and k-nearest neighbor algorithms. In addition, we make the performance comparison to show the proposed algorithm achieves better retrieval performance than the existing algorithm.