• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.10-11
• /
• 2006

The fault location is obtained from the distance relay that detects the fault of the transmission line. In this time, transmission line crews track down the fault location and the reasons. However, because of having error at the fault location of the distance relay, there is a discordance between real and obtained fault location. As this reason, the inspection time for finding fault location can be longer. In this paper, we proposed the statistical (regression) analysis method based on each type of relay's the historical fault location data and the real fault distance data to improve the problems. With finding the regression equation based on the regression analysis, and putting the relay fault location into that equation, the real fault distance is calculated. As a result of the Prediction fault location, the inspection time of transmission line can be reduced.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.491-493
• /
• 2006

We introduce Location PDA Program which is a mobile system to display current location on PDA. The current location is calculated based on collecting location through each fixed node. Each fixed node sends location information of mobile node to Cell Manager system. And then, Cell Manager calculates final location based on related information and sends it to every mobile system which is connected to server and displays current location.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.757-766
• /
• 2007

Location services are used in mobile ad hoc and hybrid networks to locate either the geographic position of a given node in the network or a data item. One of the main usages of position location services is presented in location based routing algorithms. In particular, geographic routing protocols can route messages more efficiently to their destinations based on the destination node's geographic position, which is provided by a location service. In this paper, we propose an adaptive location service on the basis of fuzzy logic called FHLS (Fuzzy Hierarchical Location Service) for mobile ad hoc networks. The adaptive location update scheme using the fuzzy logic on the basis of the mobility and the call preference of mobile nodes is used by the FHLS. The performance of the FHLS is to be evaluated by a simulation, and compared with that of existing HLS scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.1053-1056
• /
• 2012

Location information is considered to be of prime importance in Vehicular Ad Hoc NETworks (VANETs) because important decisions are made based on accurate and sound location information. Vehicles exchange their whereabouts in the form of scheduled beacon messages with their neighbors. These messages contain location, speed, time, and lane information etc. In this paper we aim at the location security in VANET and emphasize on the confidentiality and integrity of location information in case of Nonline-of-Sight (NLoS). For location confidentiality we propose a geolock-based mechanism whereas for location integrity we leverage cooperation among neighbors. In case of NLoS, the verifier vehicle asks its one-hop neighbors in an efficient way to verify the claimed location of the node on his behalf. On the basis of trust values and weightage assigned to neighbors, it is decided whether the verification is sound.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.6
• /
• pp.123-132
• /
• 2005

There are many research results for the location update cost minimization of location management in cellular networks. For minimizing the location update cost, we have to take in consideration of each users' mobility pattern. This paper suggests location area list generation and a 3-step paging method based on users' movement history with the users' profiles. Users' mobility has not only geographical regular patterns but also time-related regularity. So, the method extracts users' movement regularities in both geography and time from their movement history, and generate location area list considering the regularities. For the performance analysis of the suggested method, we have executed a simulation for suggested method with user's mobility model. The results of the simulation show that suggested algorithm has some merits in the location management cost.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.1-10
• /
• 2008

In wireless internet, the location information of the user is one of the important resources for many applications. One of these applications is Location-Based Services (LBSs) which are being popular. Because, in the LBS system, users request a location-based query to LBS servers by sending their exact location, the location information of the users can be misused by adversaries. In this regard, there must be a mechanism which can deal with privacy protection of the users. In this paper, we propose a cloaking method considering both features of K-anonymity and L-diversity. Our cloaking method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). To support this, we use a R*-tree based index structure and use filtering methods especially for the m inimum cloaking region. Finally, we show from a performance analysis that our method outperforms the existing grid based cloaking method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.960-966
• /
• 2012

It is prevalent to gather the location information from GPS, WiFi and etc, and therefore LBSNS (Location-Based SNS) has increased rapidly (such as location-augmented Twitter services). The message created from LBSNS include the specific area of interests which the message is created in or mentions. It is easy to propagate the location-based information of LBSNS by adapting the retweet function which is efficient way to propagate the message in tweeter. In this paper, we have defined the smart retweet as a automatic retweet function for efficient propagating the messages which is geo-tagging the location of interests. We have designed the smart retweet system based on the tweeter system. The user could specify the area of interests and build the social networking among the users which have interested in common area. The smart retweet system have been implemented by mesh-up services based on Open-API of trweeter and google map. It is expected that the smart retweet service proposed in this paper makes easy sharing of the location-based interesting information.

• Asia pacific journal of information systems
• /
• v.16 no.4
• /
• pp.239-254
• /
• 2006

Location-based advertising or application has been one of the drivers of third-generation mobile operators' marketing efforts in the past few years. As a result, many studies on location-based marketing or advertising have been proposed for recent several years. However, these approaches have two common shortcomings. First. most of them just suggested the theoretical architectures, which were too abstract to apply it to the real-world cases. Second, many of these approaches only consider service provider (seller) rather than customers (buyers). Thus, the prior approaches fit to the automated sales or advertising rather than the implementation of CRM. To mitigate these limitations, this study presents a novel advertisement recommendation model for mobile users. We call our model MAR-CF (Mobile Advertisement Recommender using Collaborative Filtering). Our proposed model is based on traditional CF algorithm, but we adopt the multi-dimensional personalization model to conventional CF for enabling location-based advertising for mobile users. Thus, MAR-CF is designed to make recommendation results for mobile users by considering location, time, and needs type. To validate the usefulness of our recommendation model. we collect the real-world data for mobile advertisements, and perform an empirical validation. Experimental results show that MAR-CF generates more accurate prediction results than other comparative models.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.330-338
• /
• 2009

Various applications based on the location information of things are developed as entering by the ubiquitous computing age. Wireless sensor networks are suitable to indoor location-based service because of the important features such as low-power consumption, low-cost, easy deployment, etc. To recognize the distance between nodes, the indoor location-based system transmits both ultrasound signal and radio signal periodically. However, increment of the number of deployed sensor nodes make lots of collision and interference among the signals and it can degrade the accuracy of location-based system. In this paper, we propose a beacon management mechanism to increase the probability of transmission chance to the nearest beacon from the listener. It can minimize collision and interference and reduce the error probability due to the characteristics of ultrasound.

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