• Journal of Korea Multimedia Society
• /
• v.9 no.4
• /
• pp.388-400
• /
• 2006

There are wireless location acquisition technique, LBS platform technique, and LBS application technique in the important technical elements of the LBS. In this paper, we design a location data management system which is the core base technique of the important technical elements of the LBS. The proposed system consist of an application interface of LBS, a query processor of application. service, a location estimator of the moving objects, a location information manager, a real-time data receiver, and a database of location data. This system manages efficiently the location change information of the moving objects using the database technique, suggests some useful inform to the users of LBS, and supports operation and facility of location estimation to process continuous location data of the moving objects. On the basis of location data triggering, this system supplements the problem of the related location data management systems to complement the loss of location data in the environment of real-time.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.250-257
• /
• 2010

As the variant of skyline query processing, reverse skyline Queries have been studied. However, the existing methods for processing reverse skyline Queries have the limitation of service domains and spend high costs to provide various location-based services. In this paper, we propose a new reverse skyline Query processing method that efficiently processes a query with the objects in metric spaces. In addition, the proposed method also processes continuous reverse skyline queries efficiently. In order to show the superiority of the proposed scheme, we compare it with the previous reverse skyline 벼ery processing scheme in various environments. As a result, the proposed method achieves better performance than the existing method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.667-670
• /
• 2008

센서노드는 무선 센서네트워크를 통해서 감지한 정보를 싱크에게 전송한다. 최근 휴대 무선장비의 이용률 증가로 센서네트워크에서 데이터를 수집하는 싱크를 휴대 무선장비로 대체하여 이동성을 보장하는 연구가 활발히 진행된다. 즉, 싱크가 이동성을 가짐으로써 센서노드가 감지한 정보를 전달하는 방법이 중요한 문제로 부각되고 있다. 따라서 모바일 싱크의 위치를 효율적으로 알리고, 다중 소스노드에서 다중 싱크로 정보를 전달하는 것이 필요하다. 특히, 고정된 싱크에서 사용하던 데이터 전송경로는 모바일 싱크 환경에서 더 이상 효율적이지 못하다. 본 논문에서는 소스노드의 위치정보를 제공하기 위한 서버로서 8방향 앵커시스템(Eight-Direction Anchor system: EDA)을 제안한다. EDA는 센서네트워크의 가장자리에 위치한 센서노드의 편중된 에너지 소모를 막고, 전체 센서노드를 균형적으로 사용함으로써 균등한 에너지 소모를 보장한다. 또한, 모바일 싱크가 소스노드로부터 데이터를 연속적으로 받기위해서 위치기반 최단거리 전송(Location-based Shortest Relay: LSR) 프로토콜을 제안한다. LSR은 소스노드에서 싱크로의 우회하는 경로를 막고, 최소 지연경로를 통하여 연속적인 데이터 전송을 보장한다. 실험결과를 통해서 제안 프로토콜은 효율적인 위치서비스의 제공뿐만 아니라, 다중 소스와 다중 모바일 싱크 환경에서 평균 데이터 전송 비용절감 효과를 얻을 수 있음을 보인다.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.80-88
• /
• 2005

In ubiquitous spaces, a user wants to be provided with a VOD service while moving one space to another freely. Since the traditional VOD system is dependent on user location, the VOD server transmits video data to a single client during a session. If the user moves to another space, he/she should close the old session and make a new request for the same video. However, the location-aware VOD system supports user mobility by closing and opening the session automatically. That is, the VOD system automatically perceives the movement of a user and allows the server to change the data flow so that a client near the user can receive the video data. This paper proposes a location-aware VOD service architecture and a session handoff scheme to provide a mobile user with continuous video delivery and implements a location-aware VOD prototype system based on Jini and Java. In experiment, we show that the proposed handoff scheme has a smaller handoff delay than the other handoff scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.226-228
• /
• 2004

최근에 이동객체의 위치정보를 활용한 위치기반서비스(L8S, Location Based Services)에 대한 관심이 증가하고 있다. 전통적으로 정적인 위치정보를 갖는 공간 객체는 GIS(Geographic Information System) 서버에 저장, 관리되었다. 이동객체는 시간에 따라 위치의 변화가 매우 빈번하여 위치 정보가 계속 갱신되기 때문에, 전통적인 GIS 서버로는 관리가 어렵다. 본 논문에서는 기존의 연속적인 최근접 이웃탐색 기법에서 데이터의 처리 순서에 따라 탐색공간과 계산비용이 증가하는 문제점을 슬랩을 사용하여 해결한다. 최근접 이웃의 수직연장선 사이의 공간인 슬랩 내부영역에 대해서만 탐색하도록 하여 탐색영역을 줄이고, 그 내부에 있는 점들에 대해서만 처리하여 계산비용을 줄인다.

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

As the wireless internet technology such as mobile phone, WIBRO, HSDPA develops, customized location-based services for traffic, tourism, shopping, and emergency relief has lately attracted attention. For giving customized services. we should consider dynamic characteristics of moving object which continuously change their location. In this paper, we define the context trigger type of moving object and design triggering method for processing context generated by moving object. Also we propose location-based push service platform including context trigger of moving object for supporting location-based information to user. The proposed system gathers moving object stream from the terminal based on MS-assisted or Stand-alone positioning mode of embedded GPS in terminal extract user context by user device agent, and send context information to server.

• KIISE Transactions on Computing Practices
• /
• v.23 no.4
• /
• pp.210-216
• /
• 2017

In the paper we propose and implement a new indoor localization system where the techniques of magnetic field based fingerprinting and pedestrian dead reckoning are combined. First, we determine a target's location by comparing acquired magnetic field values with a magnetic field map containing pre-collected field values at different locations and choosing the location having the closest value. As the target moves, we use pedestrian dead reckoning to estimate the expected moving path, reducing the maximum positioning error of the initial location. The system eliminates the problem of localization error accumulation in pedestrian dead reckoning with the help of the fingerprinting and does not require Wi-Fi AP infrastructure, enabling cost-effective localization solution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1266-1272
• /
• 2004

Location-Based Services(LBS) give rise to location-dependent queries of which results depend on the positions of moving objects. Because positions of moving objects change continuously, indexes of moving object must perform update operations frequently for keeping the changed position information. Existing spatial index (Grid File, R-Tree, KDB-tree etc.) proposed as index structure to search static data effectively. There are not suitable for index technique of moving object database that position data is changed continuously. In this paper, I propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. The results of my extensive experiments show the dynamic hashing index outperforms the $R^$ $R^*$-tree and the fixed grid.

• Journal of Korea Game Society
• /
• v.13 no.3
• /
• pp.47-54
• /
• 2013

In general, algorithms to find continuous k-nearest neighbors has been researched on the location based services monitoring periodically the moving objects such as vehicles and mobile phone. Those researches assume the environment that the number of query points is much less than that of moving objects and the query points are not moved but fixed. In gaming environments, cases to find k-nearest neighbors are when computing the next movement considering the neighbors such as flocking, crowd and robot simulations. Thus, every moving object becomes a query point so that the number of query point is same to that of moving objects and the query points are also moving. In this paper, we analyze the performance of the existing algorithms focused on location based services how they operate under the gaming environments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.119-122
• /
• 2016

대표적인 네트워크 기반의 이동성 기법인 PMIPv6(Proxy Mobility IPv6)은 이동 단말에 대한 끊김 없는 서비스 지원이 가능하다. 하지만 PMIPv6 기법은 단말과 홈 에이전트 간 IP Tunnel을 생성해야 하며, 그에 따른 시그널링 비용이 발생하게 된다. 또한, 단말 이동에 따른 연속적인 서비스 지원만 고려할 뿐 이동 중 발생하는 패킷 손실은 고려하지 않는 문제점이 있다. 본 논문은 이러한 문제점을 해결하기 위해 SDN(Software Defined Networks)을 적용하였다. 데이터 플레인에서 Anchor 스위치를 선정하여 이동 전 위치의 단말로 전송되던 패킷을 이동한 위치의 단말로 Re-direction 함으로써 패킷 손실을 줄이기 위한 기법을 제안한다.