• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.67-76
• /
• 2018

This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.47-58
• /
• 2012

In this paper, we propose a continuous k-nearest neighborhood query processing method for updating the query results in real-time over mobile peer-to-peer environments. The proposed method disseminates a monitoring region to efficiently monitor the k-nearest neighbor peers. The Monitoring Region is created to assure at least k peers as the result of the query within the time range using the vector of neighbor peers. In the propose method, the monitoring region is valid for a long time because it is calculated by the vector of neighbor peers of the query peer. Therefore, the proposed method decreases the cost of re-processing by monitoring region invalidation. In order to show the superiority of the proposed method, we compare it with the previous schemes through performance evaluation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1525-1530
• /
• 2011

Techniques for processing continuous queries are required to developing the various types of application services (monitoring services) in ubiquitous environment where the real-time data acquisition from a lot of sensors, analysis, and processing are required. In the previous works of the continuous queries, they have represented all of the continuous queries as the interval queries or region queries, and proposed some methods for processing theses queries. The types of continuous queries, however, are very various, and could be presented by combining the attribute conditions, spatial conditions, and temporal conditions. In this paper, I have classify the types of continuous queries, and have proposed the continuous query model which could be presented by combining those conditions. The contributions of this paper include that it proposes the query model representing the continuous queries and suggests future research directions.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.75-89
• /
• 2006

LBS (Location-Based Service) systems have become a serious subject for research and development since recent rapid advances in wireless communication technologies and position measurement technologies such as global positioning system. The architecture named the GALIS (Gracefully Aging Location Information System) has been suggested which is a cluster-based distributed computing system architecture to overcome performance losses and to efficiently handle a large volume of data, at least millions. The GALIS consists of SLDS and LLDS. The SLDS manages current location information of moving objects and the LLDS manages past location information of moving objects. In this thesis, we implement a monitoring technique for the GALIS prototype, to allow dynamic load balancing among multiple computing nodes by keeping track of the load of each node in real-time during the location data management and spatio-temporal query processing. We also propose a buffering technique which efficiently manages the query results having overlapped query regions to improve query processing performance of the GALIS. The proposed scheme reduces query processing time by eliminating unnecessary query execution on the overlapped regions with the previous queries.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1234-1238
• /
• 2010

In recent, there have been done many studies on applications that monitor the information of mobile objects using Wireless Sensor Networks (WSN). A density query that finds out an area spread by density that a target object requires in the whole sensing field is a field of object monitoring applications. In this paper, we propose a novel homogeneous network-based in-network density query processing scheme that significantly reduces query processing costs and assures high accuracy. This scheme is based on the possibility-based expected region selection technique and the result compensation technique in order to enhance the accuracy of the density query and to minimize its energy consumption. To show the superiority of our proposed scheme, we compare it with the existing density query processing scheme. As a result, our proposed scheme reduces about 92% energy consumption for query processing, while its network lifetime increases compared to the existing scheme. In addition, the proposed scheme guarantees higher accuracy than the existing scheme in terms of the query result.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.32-41
• /
• 2003

In this paper, we implemented a looms management system which supports remote monitoring and scientific management of the looms. In the implemented system, the layout of the looms is placed in the user interface, and each loom's operating state and rate are automatically represented there. The implemented system has aggregate query processing functions for the looms existing in the selected area by the louse and it also has high level query processing functions to support the chart and pivot table; it can be used as a decision support system. The proposed system can detect temporal or persistent problems of the looms. Therefore, it can be used to raise the productivity and to reduce the cost in textile companies by coping with the situation properly.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.10a
• /
• pp.76-81
• /
• 2008

최근 유비쿼터스 환경을 실현하는 기술로서 사물 및 환경 정보를 센싱하여 필요한 정보를 수집 및 분석. 처리하는 센서네트워크 기술에 대한 관심이 고조되고 있다. 특히 최근 국내에서는 u-City와 u-Port 사업 등, 범국가적인 차원의 도입을 통해 환경 정보 모니터링, 홈 자동화, 자산 물류 응용 등의 다양한 센서네트워크를 이용한 서비스가 등장하였다. 이러한 기존의 응용서비스는 모든 센서노드가 고정되어 있는 환경에서 응용 대상의 데이터를 수집하는 서비스가 대부분이다. 그러나 동물의 생태 모니터링 등의 응용을 위해서는 센서를 움직이는 대상에 부착하여 이동하는 센서노드로부터 효율적으로 데이터를 수집하기 위한 연구가 필요하다. 따라서 본 논문에서는 이동하는 센서로부터 효율적으로 데이터를 수집하기 위하여 이동노드 색인 기법을 설계한다. 아울러 제안하는 색인 기법을 위한 영역질의 처리 알고리즘을 제시한다.

• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.454-462
• /
• 2014

With the development of location aware technologies and mobile devices, location-based services have been studied. To provide location-based services, many researchers proposed methods for processing various query types with Mapreduce(MR). One of the proposed methods, is a Reverse k-nearest neighbor(RkNN) query processing method with MR. However, the existing methods spend too much cost to process the continuous RkNN query. In this paper, we propose an efficient continuous RkNN query processing method with MR to resolve the problems of the existing methods. The proposed method uses the 60-degree-pruning method. The proposed method does not need to reprocess the query for continuous query processing because the proposed method draws and monitors the monitoring area including the candidate objects of a RkNN query. In order to show the superiority of the proposed method, we compare it with the query processing performance of the existing method.

• Proceedings of the Korea Contents Association Conference
• /
• 2012.05a
• /
• pp.15-16
• /
• 2012

본 논문에서는 이동 P2P 환경에서 연속적인 서비스 제공을 위한 k-최근접 질의 처리 기법을 제안한다. 제안하는 기법은 질의 피어와 근접한 k개의 피어를 효율적으로 모니터링하기 위하여 MR(Monitoring-Region)을 배포한다. MR은 주변 피어들의 이동 벡터를 이용하여 시간 범위 내에서 최소 k개의 질의 결과를 보장하기 위해 만들어진 영역이다. 제안하는 기법은 주변 피어들의 벡터를 이용하여 MR을 계산하기 때문에 장시간 유효하며 MR 영역의 무효화에 따른 질의 재수행 비용을 절약한다. 제안하는 기법의 우수성을 입증하기 위해 기존 기법과의 성능평가를 수행한다.

• Proceedings of the Optical Society of Korea Conference
• /
• 2003.07a
• /
• pp.294-295
• /
• 2003

삶의 질이 높아감에 따라 환경에 대한 사람들의 관심이 늘어가고 있다. 그중 미소량으로도 인체에 치명적인 해를 주는 유기인 화합물에 대한 실시간 모니터링 기술이 요구되고 있다. 이를 검출할 수 있는 센서로서 광학식 센서는 기존의 센서(반도체식, 전기화학식 등)에 비하여 선택성과 반응전후의 복귀성 및 온·습도의 영향 등의 문제를 개선할 수 있다. 기존의 광학식 센서는 원적외선 영역을 이용하는데 이는 광학식 센서의 경우 높은 감도를 보이나 이들 시스템은 냉각장치를 요구하며 장비의 가격이 고가인 단점이 있다. (중략)