• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.51-56
• /
• 2016

In this paper, we propose an Arduino-based plant monitoring system. The proposed system is based on the Arduino platform, using an environmental sensor and a pressure sensor for measuring temperature, humidity and illuminance in order to monitor the state of the environment and the facilities of the plant. Monitoring data are transmitted to a ZigBee coordinator connected to a server through a radio frequency transceiver. When using a pressure sensor and the environment sensor data stored on the host server, checking the pressure in the environment of the plant and equipment is intended to report any alarm status to the administrator. Using a grid line-based key distribution scheme, the authentication node dynamically generates a data key to protect the monitoring information. Applying a ZigBee wireless sensor network does not require additional wiring for the actual implementation of a plant monitoring system. Possible working-environment monitoring of an efficient plant can help analyze the cause of any failure by backtracking the working environment when a failure occurs. In addition, it is easy to expand or add a sensor function using the Arduino platform and an expansion board.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2105-2112
• /
• 2009

Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, We suggest the way (process) satisfied with all necessary security of Privacy Protection Shreme and decreased in Tag Identification Time in this paper. First, We'll suggest the SP-Division Algorithm seperating SPs using the Performance Measurement consequence of each node after framing the program to create Hash-Chain Calculated table to get optimized performance because of character of the grid environment comprised of heterogeneous system. If we compare consequence fixed the number of nodes to 4 with a single node, equal partition, and SP partition, when the total number of SPs is 1000, 40%, 49%, when the total number of SPs is 2000, 42%, 51%, when the total number of SPs is 3000, 39%, 49%, and when the total number of SPs is 4000, 46%, 56% is improved.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.5
• /
• pp.547-554
• /
• 2010

RFID is core technology to lead ubiquitous computing, and attract the notice of the world. It also improves social transparency, creates employment, and invigorates the allied industries. However, The technical characteristic with RFID has some problems with security and privacy. The commercialization of RFID is delayed due to these problems. This paper introduces the technical method to find solutions about an invasion of privacy to be due to introduce RFID system. First, this method applies Hash-Chain proposed by M. Ohkubo and some other researchers. The more tags increase, the more it demands lots of computation time. We divide SPs equally to solve these problems. And then, We'll suggest solutions to shorten the identification time of tag by implementing SPs with multi nodes of Grid environment at the same time. This makes it possible to keep the privacy protection of RFID tag, and process RFID tag in real time at the same time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1049-1056
• /
• 2010

Recently RFID system has been adopted in various fields rapidly. However, we should solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system. To solve these problems, There is the Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of creasing numbers of Tag. Therefore We, suggest SP-Division algorithm satisfied with all necessary security of Privacy Protection Scheme and decreased in Tag Identification Time in this paper. And this paper implemented it in time standard finding the first key among the data devided into each nodes. The length of Hash-Chain holds 1000, and the total number of SPs increases 1000, 2000, 3000, and 4000. Comparing tag identification time by the total number of SPs and the number of Nodes with single node, extending the number of nodes to 1, 2, 3 and 4, when the number of nodes is 2, 40% of Performance, when the number of nodes is 3, 56%, and when the number of nodes is 4, 71% is improved.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.3
• /
• pp.157-164
• /
• 2022

In this paper, we describe how to implement the mountainous terrain, radar, and air defense network for UAV path planning in a 3-D environment, and perform path planning and re-planning using the PRM algorithm, a sampling-based path planning algorithm. In the case of the original PRM algorithm, the calculation to check whether there is an obstacle between the nodes is performed 1:1 between nodes and is performed continuously, so the amount of calculation is greatly affected by the number of nodes or the linked distance between nodes. To improve this part, the proposed LineGridMask method simplifies the method of checking whether obstacles exist, and reduces the calculation time of the path planning through parallelization. Finally, comparing performance with existing PRM algorithms confirmed that computational time was reduced by up to 88% in path planning and up to 94% in re-planning.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.3
• /
• pp.669-678
• /
• 2018

This study developed information technology infrastructures for building a driving environment analysis platform using various big data, such as vehicle sensing data, public data, etc. First, a small platform server with a parallel structure for big data distribution processing was developed with H/W technology. Next, programs for big data collection/storage, processing/analysis, and information visualization were developed with S/W technology. The collection S/W was developed as a collection interface using Kafka, Flume, and Sqoop. The storage S/W was developed to be divided into a Hadoop distributed file system and Cassandra DB according to the utilization of data. Processing S/W was developed for spatial unit matching and time interval interpolation/aggregation of the collected data by applying the grid index method. An analysis S/W was developed as an analytical tool based on the Zeppelin notebook for the application and evaluation of a development algorithm. Finally, Information Visualization S/W was developed as a Web GIS engine program for providing various driving environment information and visualization. As a result of the performance evaluation, the number of executors, the optimal memory capacity, and number of cores for the development server were derived, and the computation performance was superior to that of the other cloud computing.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.994-996
• /
• 2005

P2P 그리드 컴퓨팅 환경에서 피어의 자율성으로 인한 자원 제공의 휘발성과 피어의 이질적인 특성은 스케줄링 과정에서 해결해야 할 중요한 문제이다. 이에 본 논문에서는 이동 에이전트 기반 적응적 그룹 스케줄링 기법(Mobile Agent based Adaptive Group Scheduling Mechanism: MAAGSM)을 제안한다. 제안 기법은 피어의 특성 (즉, 자원제공자 자율성 고장, 자원제공자 가음용, 자원 제공 시간)에 따라 피어들을 동질적인 그룹(자원제공자 그룹)으로 구성한 후, 그룹에 적합한 다양한 스케줄링 알고리즘은 이동에이전트 기술을 이용하여 적용한다.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1369-1378
• /
• 2017

Pub/Sub (Publish/Subscribe) paradigm is a simple and easy to use model for interconnecting applications in a distributed environment. In general, subscribers register their interests in a topic or a pattern of events and then asynchronously receive events matching their interest, regardless of the events' publisher. In order to build a low latency lightweight pub/sub system for Internet of Things (IoT) services, we propose a GQSFPS (Group Quorum System-based Fog Pub/Sub) system that is a core component in the event-driven service oriented architecture framework for IoT services. The GQSFPS organizes multiple installed pub/sub brokers in the fog servers into a group quorum based P2P (peer-to-peer) topology for the efficient searching and the low latency accessing of events. Therefore, the events of IoT are cached on the basis of group quorum, and the delay-sensitive IoT applications of edge devices can effectively access the cached events from group quorum fog servers in low latency. The performance of the proposed GQSFPS is evaluated through an analytical model, and is compared to the GQPS (grid quorum-based pud/sub system).

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.433-435
• /
• 2006

P2P 그리드 컴퓨팅 환경에서 자원제공자가 수행한 연산 결과의 정확성을 보장하는 것은 중요한 고려사항이다. 기존의 연산 결과 검사에 대한 연구들은 중앙 서버가 연산 결과를 관리하는 중앙집중형 환경에서 이루어졌다. 그러나 중앙집중형 환경에서 중앙 서버의 부하로 인한 확장성 문제로 최근에는 분산형 환경에서 많은 연구가 진행 중이나 연산 결과 검사에 대한 연구는 없는 실정이다. 게다가 분산형 환경은 연산 결과를 관리하는 중앙 서버의 부재로 연산 결과를 신뢰하기 어렵고, 또한 검사하기도 어렵다. 이에 본 논문에서는 분산형 P2P 그리드 컴퓨팅 환경에서 자원제공자의 평판도 기반연산 결과 검사 기법을 제안한다. 제안 기법은 자원제공자의 가용성과 평판도를 기반으로 작업 트리를 구성한 후, 트리의 단계별 특징에 따라 차별화 된 연산 결과 검사와 스케줄링을 수행하여, 기존 연산 결과 검사 기법을 분산형 환경에 그대로 적용할 때보다 연산 결과의 정확성은 보장하면서 연산 결과 검사로 인한 부하는 감소시킨다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1450-1458
• /
• 2011

The HPcN (Hybrid & high Performance Convergence Network) in research networks means environment which can provide both computing resource such as supercomputer, cluster and network resource to application researchers in the field of medical, bio, aerospace and e-science. The most representative research network in Korea, KREONET has been developing following technologies through the HERO (Hybrid Networking project for research oriented infrastructure) from 200S. First, we have constructed and deployed a control plane technology which can provide a connection oriented network dynamically. Second, the integrated resource management system technology has been developing for reservation and allocation of both computing and network resources, whenever users want to utilize them. In this paper, a testbed network is presented, which is possible to reserve and allocate network resource using the integrated resource management system. We reserve network resource through GNSI (Grid Network Service Interface) messages between GRS (Global Resource Scheduler) and NRM (Network Resource Manager) and allocate network resource through GUNI (Grid User Network Interface) messages between the NRM (network resource manager) and routers, based on reservation information provided from a user on the web portal. It is confirmed that GUNI interface messages are delivered from the NRM to each router at the starting of reservation time and traffic is transmitted through LSP allocated by the NRM.