• 제목/요약/키워드: Sensor Data Processing

검색결과 1,382건 처리시간 0.038초

Spatio-temporal Sensor Data Processing Techniques

  • Kim, Jeong-Joon
    • Journal of Information Processing Systems
    • /
    • 제13권5호
    • /
    • pp.1259-1276
    • /
    • 2017
  • As technologies related to sensor network are currently emerging and the use of GeoSensor is increasing along with the development of Internet of Things (IoT) technology, spatial query processing systems to efficiently process spatial sensor data are being actively studied. However, existing spatial query processing systems do not support a spatial-temporal data type and a spatial-temporal operator for processing spatialtemporal sensor data. Therefore, they are inadequate for processing spatial-temporal sensor data like GeoSensor. Accordingly, this paper developed a spatial-temporal query processing system, for efficient spatial-temporal query processing of spatial-temporal sensor data in a sensor network. Lastly, this paper verified the utility of System through a scenario, and proved that this system's performance is better than existing systems through performance assessment of performance time and memory usage.

센서 네트워크에서 질의 처리 시스템 (Query Processing Systems in Sensor Networks)

  • 김정준;정성택
    • 한국인터넷방송통신학회논문지
    • /
    • 제17권4호
    • /
    • pp.137-142
    • /
    • 2017
  • 최근 IoT 기술의 발전과 더불어 센서 노드, RFID, CCTV, 스마트폰 등에서 다양한 데이터를 Sensing하는 기술과 무선 통신 기술이 급격히 발전하면서 여러 응용 분야에서 센서 네트워크 관련 기술을 활용하기 위한 다양한 연구가 활발히 추진되고 있다. 따라서, GeoSensor 활용이 증가함에 따라 공간 센서 데이터와 같은 2차원 데이터를 효율적으로 처리하기 위한 질의 처리 시스템이 활발히 연구되고 있다. 하지만 기존 질의 처리 시스템들은 시공간 센서 데이터와 같은 다차원 데이터를 처리하기 위한 데이터 타입과 연산자를 지원하지 않기 때문에 이와 같은 다차원 데이터를 처리하기에 미흡하다. 따라서, 본 논문은 이러한 센서 네트워크에서 다차원 데이터를 효율적으로 처리하기 위하여 질의 처리 시스템을 연구 개발하였다.

A FRAMEWORK FOR QUERY PROCESSING OVER HETEROGENEOUS LARGE SCALE SENSOR NETWORKS

  • Lee, Chung-Ho;Kim, Min-Soo;Lee, Yong-Joon
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
    • /
    • pp.101-104
    • /
    • 2007
  • Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

  • PDF

Design an Indexing Structure System Based on Apache Hadoop in Wireless Sensor Network

  • Keo, Kongkea;Chung, Yeongjee
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2013년도 춘계학술발표대회
    • /
    • pp.45-48
    • /
    • 2013
  • In this paper, we proposed an Indexing Structure System (ISS) based on Apache Hadoop in Wireless Sensor Network (WSN). Nowadays sensors data continuously keep growing that need to control. Data constantly update in order to provide the newest information to users. While data keep growing, data retrieving and storing are face some challenges. So by using the ISS, we can maximize processing quality and minimize data retrieving time. In order to design ISS, Indexing Types have to be defined depend on each sensor type. After identifying, each sensor goes through the Indexing Structure Processing (ISP) in order to be indexed. After ISP, indexed data are streaming and storing in Hadoop Distributed File System (HDFS) across a number of separate machines. Indexed data are split and run by MapReduce tasks. Data are sorted and grouped depend on sensor data object categories. Thus, while users send the requests, all the queries will be filter from sensor data object and managing the task by MapReduce processing framework.

센서 네트워크에서 다차원 데이타를 위한 쿼리 처리 시스템 (Query Processing System for Multi-Dimensional Data in Sensor Networks)

  • 김장수;김정준;김영곤;이창훈
    • 한국인터넷방송통신학회논문지
    • /
    • 제17권1호
    • /
    • pp.139-144
    • /
    • 2017
  • 최근 GeoSensor 활용이 증가함에 따라 공간 센서 데이터와 같은 2차원 데이타를 효율적으로 처리하기 위한 질의 처리 시스템이 활발히 연구되고 있다. 하지만 기존 질의 처리 시스템들은 시공간 센서 데이터와 같은 다차원 데이타를 처리하기 위한 데이타 타입과 연산자를 지원하지 않기 때문에 이와 같은 다차원 데이터를 처리하기에 미흡하다. 따라서, 본 논문은 이러한 센서 네트워크에서 다차원 데이타를 효율적으로 처리하기 위하여 질의 처리 시스템을 개발하였다. 마지막으로 본 논문은 시나리오를 통해 본 시스템의 효용성을 검증하고, 수행시간 및 메모리 사용량 등의 성능평가를 통해 기존 시스템들보다 성능이 우수함을 입증하였다.

Routing Techniques for Data Aggregation in Sensor Networks

  • Kim, Jeong-Joon
    • Journal of Information Processing Systems
    • /
    • 제14권2호
    • /
    • pp.396-417
    • /
    • 2018
  • GR-tree and query aggregation techniques have been proposed for spatial query processing in conventional spatial query processing for wireless sensor networks. Although these spatial query processing techniques consider spatial query optimization, time query optimization is not taken into consideration. The index reorganization cost and communication cost for the parent sensor nodes increase the energy consumption that is required to ensure the most efficient operation in the wireless sensor node. This paper proposes itinerary-based R-tree (IR-tree) for more efficient spatial-temporal query processing in wireless sensor networks. This paper analyzes the performance of previous studies and IR-tree, which are the conventional spatial query processing techniques, with regard to the accuracy, energy consumption, and query processing time of the query results using the wireless sensor data with Uniform, Gauss, and Skew distributions. This paper proves the superiority of the proposed IR-tree-based space-time indexing.

사물인터넷 환경에서 센서데이터의 처리를 위한 적응형 우선순위 큐 기반의 작업 스케줄링 (Adaptive Priority Queue-driven Task Scheduling for Sensor Data Processing in IoT Environments)

  • 이미진;이종식;한영신
    • 한국멀티미디어학회논문지
    • /
    • 제20권9호
    • /
    • pp.1559-1566
    • /
    • 2017
  • Recently in the IoT(Internet of Things) environment, a data collection in real-time through device's sensor has increased with an emergence of various devices. Collected data from IoT environment shows a large scale, non-uniform generation cycle and atypical. For this reason, the distributed processing technique is required to analyze the IoT sensor data. However if you do not consider the optimal scheduling for data and the processor of IoT in a distributed processing environment complexity increase the amount in assigning a task, the user is difficult to guarantee the QoS(Quality of Service) for the sensor data. In this paper, we propose APQTA(Adaptive Priority Queue-driven Task Allocation method for sensor data processing) to efficiently process the sensor data generated by the IoT environment. APQTA is to separate the data into job and by applying the priority allocation scheduling based on the deadline to ensure that guarantee the QoS at the same time increasing the efficiency of the data processing.

센서 네트워크 기반의 홀리스틱 분산 클러스터링 알고리즘 (A holistic distributed clustering algorithm based on sensor network)

  • 진평;임기욱;남지은;이경오
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2008년도 추계학술발표대회
    • /
    • pp.874-877
    • /
    • 2008
  • Nowadays the existing data processing systems can only support some simple query for sensor network. It is increasingly important to process the vast data streams in sensor network, and achieve effective acknowledges for users. In this paper, we propose a holistic distributed k-means algorithm for sensor network. In order to verify the effectiveness of this method, we compare it with central k-means algorithm to process the data streams in sensor network. From the evaluation experiments, we can verify that the proposed algorithm is highly capable of processing vast data stream with less computation time. This algorithm prefers to cluster the data streams at the distributed nodes, and therefore it largely reduces redundant data communications compared to the central processing algorithm.

Study on Data Processing of the IOT Sensor Network Based on a Hadoop Cloud Platform and a TWLGA Scheduling Algorithm

  • Li, Guoyu;Yang, Kang
    • Journal of Information Processing Systems
    • /
    • 제17권6호
    • /
    • pp.1035-1043
    • /
    • 2021
  • An Internet of Things (IOT) sensor network is an effective solution for monitoring environmental conditions. However, IOT sensor networks generate massive data such that the abilities of massive data storage, processing, and query become technical challenges. To solve the problem, a Hadoop cloud platform is proposed. Using the time and workload genetic algorithm (TWLGA), the data processing platform enables the work of one node to be shared with other nodes, which not only raises efficiency of one single node but also provides the compatibility support to reduce the possible risk of software and hardware. In this experiment, a Hadoop cluster platform with TWLGA scheduling algorithm is developed, and the performance of the platform is tested. The results show that the Hadoop cloud platform is suitable for big data processing requirements of IOT sensor networks.

지능형 센서의 데이터 처리 모듈 개발 (Development of data processing module of intelligent sensor)

  • 김인욱;임동진
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 B
    • /
    • pp.954-956
    • /
    • 1999
  • In the case of using sensor in the industrial control systems, the location of sensor is not close to the system which utilizes the sensor data. Two main functions of intelligent sensor are data processing and communication. In this paper, we will show that the developed result of intelligent sensor, which process the sensor data inside of the sensor module, except for the communication function. For this, we refered to the Profibus and Fieldbus Foundation standard.

  • PDF