• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.5
• /
• pp.901-909
• /
• 2021

Since mobile devices have limited computational resources, it tends to use the cloud to compute or store data. As real-time becomes more important due to 5G, many studies have been conducted on edge clouds that computes at locations closer to users than central clouds. The farther the user's physical distance from the edge cloud connected to base station is, the slower the network transmits. So applications should be migrated and re-run to nearby edge cloud for smooth service use. We run applications in docker containers, which is independent of the host operating system and has a relatively light images size compared to the virtual machine. Existing migration studies have been experimented by using network simulators. It uses fixed values, so it is different from the results in the real-world environment. In addition, the method of migrating images through shared storage was used, which poses a risk of packet content exposure. In this paper, Containers are migrated with Secure CoPy(SCP) method, a data encryption transmission, by establishing an edge computing environment in a real-world environment. It compares migration time with Network File System, one of the shared storage methods, and analyzes network packets to verify safety.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.748-756
• /
• 2013

This paper addresses the problem of online hop timing detection and frequency estimation of multiple frequency-hopping (FH) signals with antenna arrays. The problem is deemed as a dynamic one, as no information about the hop timing, pattern, or rate is known in advance, and the hop rate may change during the observation time. The technique of particle filtering is introduced to solve this dynamic problem, and real-time frequency and direction of arrival estimates of the FH signals can be obtained directly, while the hop timing is detected online according to the temporal autoregressive moving average process. The problem of network sorting is also addressed in this paper. Numerical examples are carried out to show the performance of the proposed method.

• Smart Structures and Systems
• /
• v.16 no.6
• /
• pp.1133-1145
• /
• 2015

A new neural network (NN) predictive controller (NNPC) algorithm has been developed and tested in the computer simulation of active control of a nonlinear structure. In the present method an NN is used as a predictor. This NN has been trained to predict the future response of the structure to determine the control forces. These control forces are calculated by minimizing the difference between the predicted and desired responses via a numerical minimization algorithm. Since the NNPC is very time consuming and not suitable for real-time control, it is then used to train an NN controller. To consider the effectiveness of the controller on probability of damage, fragility curves are generated. The approach is validated by using simulated response of a 3 story nonlinear benchmark building excited by several historical earthquake records. The simulation results are then compared with a linear quadratic Gaussian (LQG) active controller. The results indicate that the proposed algorithm is completely effective in relative displacement reduction.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.382-392
• /
• 1999

Industrial robots have increased in both the number and applications in today's material handling systems. However, traditional approaches to robot controling have had limited success in complicated environment, especially for real time applications. One of the main reasons for this is that most traditional methods use a set of kinematic equations to figure out the physical environment of the robot. In this paper, a neural network model to solve robot manipulator's inverse kinematics problem is suggested. It is composed of two Self-Organizing Feature Maps by which the workspace of robot environment and the joint space of robot manipulator is inter-linked to enable the learning of the inverse kinematic relationship between workspace and joint space. The proposed model has been simulated with two robot manipulators, one, consisting of 2 links in 2-dimensional workspace and the other, consisting of 3 links in 2-dimensional workspace, and the performance has been tested by accuracy of the manipulator's positioning and the response time.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.249-254
• /
• 2008

Moored ocean buoys are technically feasible approach for making sustained time series observation in the oceans and will be an important component of any long-term ocean observing system. The 3M disc buoy carried Zeno 3200, MCCB, Orbcomm, Global Star and Bluetooth module. The deployments have relied on Orbcomm and Global Star as the primary satellite communications system. In addition to detailing our practical experience in the use of Orbcomm and Global Star as high latitudes, we will present some of scientific sensor results regarding real-time oceanographic and meteorological parameters such as wind speed, wave height and etc. In this paper we present the design and implementation of a small-scale buoy sensor network. One of the major challenges is that the network is hard to access after its deployment and hence both hardware and software must be robust and reliable.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.82-87
• /
• 1993

A supervisory controller design technique for multiple-AGV systems is presented in this paper. The guidepath is represented in the form of a network, and its modifications are easily tested. The network has two-layered structure, where the path sets between each two nodes are made in advance using the K-shortest path algorithm. Occupation times for all links are stored in link-occupation table, and are updated after the dispatching time. Dispatching and scheduling for each AGV are optimized in terms of minimum-time objectives. In all times, the paths are guaranteed to be conflict-free and deadlock-free. The simplicity and flexibility on this control scheme make the supervisory suitable for real applications.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.133-140
• /
• 2005

The whole network system is paralyzed due to excess event of security server once in a while. If that happens, We have to analyze the cause of events, the time will require when we deal with a matter All the while, ACU(ACCESS CONTROL UNIT) and security server are off, We can not treat about information retrieval of people who come to building with real time. In this paper, we suggested classification algorithm in order to prevent of information explosion.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.3
• /
• pp.63-72
• /
• 1996

In this paper, we propose a design technique for a neural network controller and apply it to power system stabilization. Using a learning algorithm of error back propagation that accepts error and change of error as inputs, the momentum learning technique is used by which reduction of learning time is possible for real time control. The related simulation results show that the proposed control techinque is more powerful than the conventional ones for dynamic responses.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.155-164
• /
• 2000

Recently Fiber-optic Micro-cellular Wireless Network is considered to solve frequent handoffs and local traffic unbalance in microcellular systems. In this system, central station which is connected to several microcells by optical fiber manages the channels. We propose an efficient sectorization algorithm which dynamically clusters the microcells to minimize the blocked and handoff calls and to balance the traffic loads in each cell. The problem is formulated as an integer linear programming. The objective is to minimize the blocked and handoff calls. To solve this real time sectorization problem the Tabu Search is considered. In the tabu search intensification by Swap and Delete-then-Add (DTA) moves is implemented by short-term memory embodied by two tabu lists. Diversification is considered to investigate proper microcells to change their sectors. Computational results show that the proposed algorithm is highly effective. The solution is almost near the optimal solution and the computation time of the search is considerably reduced compared to the optimal procedure.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1225-1232
• /
• 2001

In this paper, we investigate the scheduling algorithm of router system for Internet services on large scale ATM networks based on the quality-of-service(QoS) level of the input source traffics. We suggest an approprite scheduling algorithm in order to satisfy their QoS requirements. For this purpose, we first study the service requirements of the multiplexer in Internet. Second, we suggest functional architecture of the multiplexer for real time services and the scheduling algorithm to satisfy various QoS requirements. Finally, the performance measures of interest, namely steady-state average delay time and fairness of network resources, are discussed by simulation results.