• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.261-269
• /
• 2023

We propose to design a Holochain-based security and privacy protection system for resource-constrained IoT healthcare systems. Through analysis and performance evaluation, the proposed system confirmed that these characteristics operate effectively in the IoT healthcare environment. The system proposed in this paper consists of four main layers aimed at secure collection, transmission, storage, and processing of important medical data in IoT healthcare environments. The first PERCEPTION layer consists of various IoT devices, such as wearable devices, sensors, and other medical devices. These devices collect patient health data and pass it on to the network layer. The second network connectivity layer assigns an IP address to the collected data and ensures that the data is transmitted reliably over the network. Transmission takes place via standardized protocols, which ensures data reliability and availability. The third distributed cloud layer is a distributed data storage based on Holochain that stores important medical information collected from resource-limited IoT devices. This layer manages data integrity and access control, and allows users to share data securely. Finally, the fourth application layer provides useful information and services to end users, patients and healthcare professionals. The structuring and presentation of data and interaction between applications are managed at this layer. This structure aims to provide security, privacy, and resource efficiency suitable for IoT healthcare systems, in contrast to traditional centralized or blockchain-based systems. We design and propose a Holochain-based security and privacy protection system through a better IoT healthcare system.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.2
• /
• pp.167-174
• /
• 2014

In this paper, we address a task allocation problem for a robot team that performs a search and attack mission. The robots are limited in sensing and communication capabilities, and carry different types of resources that are used to attack a target. The environment is uncertain and dynamic where no prior information about targets is given and dynamic events unpredictably happen. The goal of robot team is to collect total utilities as much as possible by destroying targets in a mission horizon. To solve the problem, we propose a distributed task allocation framework incorporated with effective resource management based on resource welfare. The framework we propose enables the robot team to retain more robots available by balancing resources among robots, and respond smoothly to dynamic events, which results in system performance improvement.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.5
• /
• pp.1100-1107
• /
• 2016

• Journal of KIBIM
• /
• v.10 no.3
• /
• pp.43-53
• /
• 2020

BIM-based Cloud platform gained popularity coupled with the convergence of Fourth Industrial Revolution technology. However, most of the previous work has not guaranteed sufficient efficiency to meet user requirements according to BIM service. Furthermore, the Cloud environment is only used as a server and it does not consider cloud characteristics. For the processing of High Capacity Data like BIM and using seamless BIM service, Resource management technology is required in the cloud environment. In this paper, to solve the problems, we propose a BIM platform for BaaS and an efficient resource allocation scheme. We also proved the efficiency of resource for the proposed scheme by using existing schemes. By doing this, the proposed scheme looks forward to accelerating the growth of the BaaS through improving the user experience and resource efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.69-75
• /
• 2006

Internet-based distributed computing environment have been developed for advanced science and engineering by sharing large-scale resources. Therefore efficient scheduling algorithms for allocating user job to resources in the Internet-based distributed computing environment are required. Many scheduling algorithms have been proposed. but these algorithms are not suitable for the Internet-based Distributed computing environment. That is the previous scheduling algorithm does not consider peer self-control. In this paper, we propose a Peer Availability Period Prediction Strategy for Internet-based distributed computing environment and show that our Strategy has better performance than other Strategy through extensive simulation.

• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.129-136
• /
• 2006

Grid computing has been appeared for solving large-scaled data which are not solved by a single computer. Grid computing is a new generation platform which connects geographically distributed heterogeneous resources. However, gathering heterogeneous distributed resources produces many difficult problems. Especially. to assure resource reliability is one of the most critical problems. So, we propose a grid resource scheduling model using grid resource reliability measurement. We evaluate resource reliability based on resource status data and apply it to the grid scheduling model in DEVSJAVA modeling and simulation. This paper evaluates parameters such as resource utilization, job loss and average turn-around time and estimates experiment results of our model in comparison with those of existing scheduling models such as a random scheduling model and a round-robin scheduling model. These experiment results showed that the resource reliability measurement scheduling model provides efficient resource allocation and stable Job processing in comparison with a random scheduling model and a round-robin scheduling model.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.533-540
• /
• 2006

This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.2035-2046
• /
• 2015

Recently, researches on resource allocation algorithms operating in a distributed way are widely conducted because of the increasing number of network nodes and the rapidly changing the network environment. In this paper, we propose Multi-Hop DESYNC(MH DESYNC), that is bio-inspired TDMA-based resource allocation scheme operating in a distributed manner in multi-hop networks. In this paper, we define a frame structure for the proposed MH DESYNC algorithm and firing message structure which is a reference for resource allocation and propose the related operating procedures. We show that MH DSYNC can resolve the hidden-node problem effectively and verify that each node shares resources fairly among its neighboring nodes. Through simulation evaluations, it is shown that MH DESYNC algorithm works well in a multi-hop networks. Furthermore, results show that MH DESYNC algorithm achieves better performance than CSMA/CA algorithm in terms of throughput.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.36-54
• /
• 2014

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2009.06a
• /
• pp.287-288
• /
• 2009

In this paper we developed positioning algorithm considering distributed energy resource of ocean side by load flow calculation using Newton-Rhapson method.