• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.283-298
• /
• 2006

The TPR-tree is the time-parameterized indexing scheme that supports the querying of the current and projected future positions of such moving objects by representing the locations of the objects with their coordinates and velocity vectors. If this index is, however, used in environments that directions and velocities of moving objects, such as vehicles, are very often changed, it increases the communication cost between the server and moving objects because moving objects report their position to the server frequently when the direction and the velocity exceed a threshold value. To preserve the communication cost regularly, there can be used a manner that moving objects report their position to the server periodically. However, the periodical position report also has a problem that lineal time functions of the TPR-tree do not guarantee the accuracy of the object's positions if moving objects change their direction and velocity between position reports. To solve this problem, we propose the query processing scheme and the data structure using road networks for predicting uncertainty positions of moving objects, which is reported to the server periodically. To reduce an uncertainty of the query region, the proposed scheme restricts moving directions of the object to directions of road network's segments. To remove an uncertainty of changing the velocity of objects, it puts a maximum speed of road network segments. Experimental results show that the proposed scheme improves the accuracy for predicting positions of moving objects than other schemes based on the TPR-tree.

• 한국IT서비스학회:학술대회논문집
• /
• 2009.05a
• /
• pp.432-435
• /
• 2009

최근 USN(Ubiquitous Sensor Network) 기반 기술과 사회 전반에 걸친 USN 응용 기술의 발전이 가속화되고 있다. 이러한 USN 응용은 USN 자원에 대한 정보를 필요로 하며, USN 미들웨어는 USN 응용의 용이한 개발을 위해 USN 자원 정보를 제공하는 디렉토리 서비스를 핵심 요소에 포함하고 있다. USN 응용 지원을 위한 디렉토리 서비스는 광역적으로 분산된 컴퓨팅 환경에서 원하는 USN 자원 정보 즉 메타데이타를 효율적으로 관리하고 검색할 수 있는 기능이 요구 된다. 본 논문은 광역 분산 환경에서 USN 자원의 메타데이타를 효율적으로 검색할 수 있는 디렉토리 서비스의 위치탐색 모델을 논하고, USN 자원의 분포와 위치탐색 요청의 지역범위 별 빈도를 고려한 시뮬레이션 실험 결과를 제시한다.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.448-464
• /
• 2007

Location-Based Services (LBSs) provide results to queries according to the location of the client issuing the query. In LBS, techniques such as caching and prefetching are effective approaches to reducing the data transmission from a server and query response time. However, they can lead to cache inefficiency and network overload due to the client's mobility and query pattern. To solve these drawbacks, we propose a semantic prefetching (SP) scheme using prefetching segment concept and improved cache replacement policies. When a mobile client enters a new service area, called semantic prefetching area, proposed scheme fetches the necessary semantic information from the server in advance. The mobile client maintains the information in its own cache for query processing of location-dependent data (LDD) in mobile computing environment. The performance of the proposed scheme is investigated in relation to various environmental variables, such as the mobility and query pattern of user, the distributions of LDDs and applied cache replacement strategies. Simulation results show that the proposed scheme is more efficient than the well-known existing scheme for range query and nearest neighbor query. In addition, applying the two queries dynamically to query processing improves the performance of the proposed scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.316-320
• /
• 2008

Data dissemination schemes for wireless sensor networks, where sinks and event targets might be mobile, has been one of the active research fields. For doing that, stationary nodes gathered data on behalf of mobile sinks and the relayed data in previous studies. their schemes, however, lead to frequent query flooding and report congestion problems over sink moving. We propose a data dissemination protocol to solve both the query flooding and the report congestion problem. Our scheme improves the two shortcomings through sink location management. Finally, we prove effectiveness of our protocol through computer simulations.

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

With the recent development of the ubiquitous computing technology, there are increasing interest and research in technologies such as sensors and RFID related to information recognition and location positioning in various ubiquitous fields. Especially, a standard specification was required for compatibility and interoperability in various RTLS(Real-Time Locating Systems) according to the development of RTLS to provide location and status information of moving objects using the RFID Tag. For these reasons, the ISO/IEC published the RTLS standard specification for compatibility and interoperability in RTLS. Therefore, in this paper, we designed and im plemented RTLS based on the spatial DSMS(Data Stream Management Stream) for efficiently managing and searching the incoming data stream of moving objects. The spatial DSMS is an extended system of STREAM(STanford stREam datA Manager) developed by Standford University to make various spatial operations possible. RTLS based on the spatial DSMS uses the SOAP(Simple Object Access Protocol) message between client and server for interoperability and translates client's SOAP message into CQL(Continuous Query Language) of the spatial DSMS. Finally, we proved the efficiency of RTLS based on the spatial DSMS by applying it for the staff location management service.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.3
• /
• pp.79-91
• /
• 2008

Recently, with highly Interest In Location-Based Service(LBS) utilizing location data of moving objects, the GALIS(Gracefully Aging Location Information System) which is a cluster-based distributed computing architecture was proposed as a more efficient location management system of moving objects. In the SLDS(Short-term location Data Subsystem) which Is a subsystem of the GALIS, since the SDP(Short-term Data Processor) Master transmits current location data and queries to every SDP Worker, the SDP Master reassembles and sends query results produced by SDP Workers to the client. However, the services are suspended during the SDP Master under failure and the response time to the client is increased if the load is concentrated on the SDP Master. Therefore, in this paper, the extended SLDS was designed and implemented to solve these problems. Though one SDP Master is under failure, the other can provide the services continually, and so the extended SLDS can guarantee the high reliability of the SLDS. The extended SLDS also can reduce the response time to the client by enabling two SDP Masters to perform the distributed query processing. Finally, we proved high reliability and high availability of the extended SLDS by implementing the current location data storage, query processing, and failure takeover scenarios. We also verified that the extended SLDS is more efficient than the original SLDS through the query processing performance evaluation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.184-186
• /
• 2001

VOD 서비스에서 멀티캐스팅 기법을 적용하여 여러 클라이언트가 동일한 스트림을 공유함으로써 네트워크 대역폭을 절약하려는 연구가 활발하다. 패칭 방법은 기존에 전송되고 있는 멀티캐스팅 스트림을 공유하여 디스크에 임시로 저장하고, 별도의 채널을 생성하여 공유가 불가능한 초기 데이타 스트림을 수신하여 재생한다. 초기 데이타에 대한 재생이 끝나게 되면, 디스크에 저장된 데이타에 대한 재생을 수행한다. 패칭 방식은 네트워크 대역폭을 절약할 수 있는 효과와 더불어 클라이언트의 초기 대기시간을 최소화하여 True VOD를 지원한다. 본 논문에서는 패칭 방식의 VOD 시스템에서 VCR 연산 지원 방식을 제시한다. 멀티캐스팅 환경에서의 VCR 연산은 멀티캐스트 채널에 대한 관리와 개별 클라이언트에 대한 세션 정보의 효율적인 관리를 전제로 하고 있다. 지원하는 종류로는 점프(임의위치 재생), 일시정지 및 일시정지 재개, 종료가 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.643-645
• /
• 1999

통신망에서 시각/주파수 동기(synchronization)를 맞추기 위해서는 지상망을 이용하거나 위성을 이용하는 방법이 있다. 위성을 이용한 방법에서 지상의 송신국은 정밀시각정보, 위성위치데이타 및 오차보정데이타 등을 위성으로 송신한다. 이를 위해서 송신국의 위성데이터처리장치는 데이터 수집 및 가공, 베이스 밴드부로의 전송시 외부 기능블럭들과 신뢰성 있고 신속한 데이터처리를 수행하여야 한다. 본 논문에서는 한국통신의 무궁화위성을 이용한 시각/주파수 전송시스템 개발의 일환으로 송신국의 위성데이타처리장치에 대한 설계 및 구현 알고리즘을 제시하고자 한다.