• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.450-470
• /
• 2023

Traditional cloud computing faces some challenges such as huge energy consumption, network delay and single point of failure. Edge computing is a typical distributed processing platform which includes multiple edge servers closer to the users, thus is more robust and can provide real-time computing services. Although outsourcing data to edge servers can bring great convenience, it also brings serious security threats. In order to provide image retrieval while ensuring users' data privacy, a privacy preserving image retrieval scheme in edge environment is proposed. Considering the distributed characteristics of edge computing environment and the requirement for lightweight computing, we present a privacy-preserving image retrieval scheme in edge computing environment, which two or more "honest but curious" servers retrieve the image quickly and accurately without divulging the image content. Compared with other traditional schemes, the scheme consumes less computing resources and has higher computing efficiency, which is more suitable for resource-constrained edge computing environment. Experimental results show the algorithm has high security, retrieval accuracy and efficiency.

• Journal of Astronomy and Space Sciences
• /
• v.28 no.3
• /
• pp.241-252
• /
• 2011

A simulated network protocol provides the capability of distributed simulation to a generic simulator. Through this, full coverage of management of data and service handling among separated simulators is achieved. The distributed simulation environment is much more conducive to handling simulation load balancing and hazard treatment than a standalone computer. According to the simulated network protocol, one simulator takes on the role of server and the other simulators take on the role of client, and client is controlled by server. The purpose of the simulated network protocol is to seamlessly connect multiple simulator instances into a single simulation environment. This paper presents the development of a simulated network (simNetwork) that provides the capability of distributed simulation to a generic simulator (GenSim), which is a software simulator of satellites that has been developed by the Korea Aerospace Research Institute since 2010, to use as a flight software validation bench for future satellite development.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.24-34
• /
• 1994

In most computer networks, each node needs to have correct routing information for finding shortest paths to forward data packets. In a distributed environment, however, it is very difficult to keep consistent routing information throughout the whole network at all times. The presence of out-dated routing information can cause loop-forming which in turn causes the significant degradation of network performance. In this paper, a new class of routing algorithm for loop detection and resolution is discussed. The proposed algorithm is based on the distributed Bellman-Ford algorithm which is popularly adopted for routing in computer network. The proposed algorithm detects and resolves all kinds( two-node and multi-node) of loop in a distributed environment within finite time while maintaining the simplicity of the distributed Bellman-Ford algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.49-57
• /
• 2008

In this paper, we propose a novel hierarchical distributed intrusion detection system, named HNHDIDS(Home Network Hierarchical Distributed Intrusion Detection System), which is not only based on the structure of distributed intrusion detection system, but also fully consider the environment of secure home networks service. The proposed system is hierarchically composed of the one-class support vector machine(support vector data description) and local agents, in which it is designed for optimizing for the environment of secure home networks service. We support our findings with computer experiments and analysis.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.251-256
• /
• 2006

본 논문에서는 분산 촉각 가상 환경(DHVE; Distributed Haptic Virtual Environments)에서 촉각(haptic) 데이터가 어느 정도의 네트워크 트래픽을 가지며 또 효율적으로 통신 하는지에 대하여 실험하고 그 결과를 기술한다. 본 연구에서 제시하는 실험 데이터는 차세대 인터페이스로 떠오르는 촉각 장치의 높은 전송량과 실시간성을 요구하는 데이터가 분산 환경에서 서비스될 때 어떤 문제점을 가지는지에 대한 실질적이고 의미 있는 자료로 활용될 수 있을 것이다. 본 논문을 통해 우리는 기존의 분산 가상 환경들의 주요 논쟁점인 확장성(scalability), 안정성(safety) 등이 촉각 가상 환경에서는 어떻게 달라지는지 예측하고, 분산 가상 환경에서의 촉각 장치 활용의 유용성, 효율적인 네트워크 사용 방법, 촉각 기반 가상 환경이 구동될 수 있는 최저의 조건에 대해 고찰해 볼 수 있다. 본 논문은 차세대 인터페이스인 촉각 장치를 기존의 시스템에 안정적으로 추가하는 작업에 도움을 주며, 미래의 실감형 네트워크 가상 현실(Immersive Network Virtual Environment) 연구에 기초자료로 활용할 수 있을 것이다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.285-292
• /
• 2018

In this paper, we propose a distributed search of a cluster robot using tree structure in an unknown environment. In the proposed method, the cluster robot divides the unknown environment into 4 regions by using the LRF (Laser Range Finder) sensor information and divides the maximum detection distance into 4 regions, and detects feature points of the obstacle. Also, we define the detected feature points as Voronoi Generators of the Voronoi Diagram and apply the Voronoi diagram. The Voronoi Space, the Voronoi Partition, and the Voronoi Vertex, components of Voronoi, are created. The generated Voronoi partition is the path of the robot. Voronoi vertices are defined as each node and consist of the proposed tree structure. The root of the tree is the starting point, and the node with the least significant bit and no children is the target point. Finally, we demonstrate the superiority of the proposed method through several simulations.

• Convergence Security Journal
• /
• v.5 no.3
• /
• pp.15-22
• /
• 2005

The spread of Internet and the appear of Downsizing, SI(System Integration) is chaning centralized computing to distributed computing. Also distributed computing is rapidly changing to Ubiquitous computing escape from hard wire connected network. CORBA(Common Object Request Broker Architecture) is a middleware that used for smoothness communication between application program and operation system in a different environment. However distributed computing environment is not safe from the danger, the attack like virus, worm is too intellectual and variety. In this paper, we design a new DB security model and suggest efficiency of it in Ubiquitous environment base on CSS(CORBA Security Service) that present ed from OMG(Object Management Group).

• Journal of Korea Multimedia Society
• /
• v.20 no.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.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.17-29
• /
• 2007

This paper addresses a RNG based scatternet topology formation, self-healing, and routing path optimization for small-scale distributed environment, which is called RNG-FHR(Scatternet Formation, self-Healing and self-Routing path optimization) algorithm. We evaluated the algorithm using ns-2 and extensible Bluetoothsimulator called blueware to show that RNG-FHR does not have superior performance, but is simpler and more practical than any other distributed algorithms from the point of depolying the network in the small-scale distributed dynamic environment due to the exchange of fewer messages and local control. As a result, we realized that even though RNG-FHR is unlikely to be possible for deploying in large-scale environment, it surely can be deployed for performance and practical implementation in small-scale environment.

• Journal of Korean Society on Water Environment
• /
• v.27 no.5
• /
• pp.587-596
• /
• 2011

The interest in hydrological modeling has increased significantly recently due to the necessity of watershed management, specifically in regards to lumped models, which are being prosperously utilized because of their relatively uncomplicated algorithms which require less simulation time. However, lumped models require empirical coefficients for hydrological analyses, which do not take into consideration the heterogeneity of site-specific characteristics. To overcome such obstacles, a distributed model was offered as an alternative and the number of researches related to watershed management and distributed models has been steadily increasing in the recent years. Thus, in this study, the feasibility of a grid-based rainfall-runoff model was reviewed using the flood runoff process in the Han River basin, including the ChungjuDam, HoengseongDam and SoyangDam watersheds. Hydrological parameters based on GIS/RS were extracted from basic GIS data such as DEM, land cover, soil map and rainfall depth. The accuracy of the runoff analysis for the model application was evaluated using EFF, NRMSE and QER. The calculation results showed that there was a good agreement with the observed data. Besides the ungauged spatial characteristics in the SoyangDam watershed, EFF showed a good result of 0.859.