• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.615-622
• /
• 2009

In this paper, we consider the problem of applying NEMO in PMIPv6, and propose a method to support network mobility. When an MR enters a PMIPv6 domain, an MAG recognizes the MR to access using the BU message. And the MAG makes a tunnel between the MAG and the MR. The MR do not make tunnel fundamentally except for handover. Therefore, the PMIPv6 protocol needs to modify the original algorithm and the BCE data filed. However, the proposed method can use NEMO without protocol modification. To show verification, we implement our proposed algorithm with added BCE data filed using C program, and configure a testbed network. Through a network connectivity procedure, we can see that our proposed method can support network mobility within the PMIPv6 network.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.7
• /
• pp.327-331
• /
• 2008

Optimal Extension Fields (OEFs) are finite fields of a special form which are very useful for software implementation of elliptic curve cryptosystems. Bailey and Paar introduced efficient OEF arithmetic algorithms including the $p^ith$ powering operation, and an efficient algorithm to construct OEFs for cryptographic use. In this paper, we give a counterexample where their $p^ith$ powering algorithm does not work, and show that their OEF construction algorithm is faulty, i.e., it may produce some non-OEFs as output. We present improved algorithms which correct these problems, and give improved statistics for the number of OEFs.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.12
• /
• pp.65-74
• /
• 2008

This paper deals with the path creation for stable action of a robot and transformation by using the fuzzy algorithm. Also, the obstacle detection and environmental analysis are performed by a stereo vision device. The robot decides the range and the height using the fuzzy algorithm. Therefore the robot can be adapted in topography through a transformation by itself. In this paper, the robot is designed to have two advantages. One is the fast movability in flat topography with the use of wheels. The other is the moving capability in uneven ground by walking. It has six leg forms for a stable walk. The wheels are fixed on the legs of the robot, so that various driving is possible. The height and the width of robot can be changed variously using four joints of each leg. The wheeled joint has extra DOF for a rotation of vertical axis. So the robot is able to rotate through 360 degrees. The robot has various sensors for checking the own state. The stable action of a robot is achieved by using sensors. We verified the result of research through an experiment.

• Journal of the Korean Society of Industry Convergence
• /
• v.2 no.2
• /
• pp.91-102
• /
• 1999

The paper describes a robust adaptive control algorithm for induction motor drive without speed sensor at low speed range. The control algorithm use only current sensors in a space vector pulse width modulation within loop control with rotor speed estimation and voltage source inverter. On-line rotor speed estimation is based on utilizing parallel model reference adaptive control system. MRAC of the modified flux model for flux and rotor speed estimator uses dual-adaptation mechanism, ${\omega}_r$ and ${\omega}_e$ scheme. The estimated flux components in the model can be compensated from the effects of offset errors on pure integrals. It can be compensated to the parameter variations and torque fluctuation with speed estimation in less then 10 rad/sec. In a simulation, the proposed induction motor control algorithm without speed sensor at very low speed range are shown to operate very well in spite of variable rotor time constant and fluctuating load without change the controller parameters. The suggested control strategy and estimation method have been validated by simulation study, and it proposed the designed system for the implementation using TI320C31 DSP/ASIC controller.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5455-5475
• /
• 2016

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.625-634
• /
• 2002

Cryptography is the methods of making and using secret writing that is necessary to keep messages private between two parties. Cryptography is compute-intensive algorithm and needs cpu resource excessively. To solve these problems, there exists hardware approach that implements cryptographic algorithm with hardware chip. In this paper, we presents the design and implementation of cryptographic hardware and compares its performance with software cryptographic algorithms. The experimental result shows that the hardware approach causes high I/O overheads when it transmits data between cryptographic board and host cpu. Hence, low complexity cryptographic algorithms such as DES does not improve the performance. But high complexity cryptographic algorithms such as Triple DES improve the performance with a high rate, roughly from two times to Sour times.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.740-743
• /
• 1998

This paper presents an optimization algorithm for a stable Dynamic Neural Network (DNN) using genetic algorithm. Optimized DNN is applied to a problem of controlling nonlinear dynamical systems. DNN is dynamic mapping and is better suited for dynamical systems than static forward neural network. The real time implementation is very important, and thus the neuro controller also needs to be designed such that it converges with a relatively small number of training cycles. SDNN has considerably fewer weights than DNN. The object of proposed algorithm is to the number of self dynamic neuron node and the gradient of activation functions are simultaneously optimized by genetic algorithms. To guarantee convergence, an analytic method based on the Lyapunov function is used to find a stable learning for the SDNN. The ability and effectiveness of identifying and controlling, a nonlinear dynamic system using the proposed optimized SDNN considering stability' is demonstrated by case studies.

• Smart Structures and Systems
• /
• v.5 no.3
• /
• pp.223-240
• /
• 2009

As in any engineering application, the problem of structural assessment should face the different uncertainties present in real world. The main source of uncertainty in Health Monitoring System (HMS) applications are those related to the sensor accuracy, the theoretical models and the variability in structural parameters and applied loads. In present work, two methodologies have been developed to deal with these uncertainties in order to adopt reliable decisions related to the presence of damage. A simple example, a steel beam analysis, is considered in order to establish a liable comparison between them. Also, such methodologies are used with a developed structural assessment algorithm that consists in a direct and consistent comparison between sensor data and numerical model results, both affected by uncertainty. Such algorithm is applied to a simple concrete laboratory beam, tested till rupture, to show it feasibility and operational process. From these applications several conclusions are derived with a high value, regarding the final objective of the work, which is the implementation of this algorithm within a HMS, developed and applied into a prototype structure.

• Nuclear Engineering and Technology
• /
• v.48 no.5
• /
• pp.1126-1139
• /
• 2016

In this research, for the first time, a new optimization method, i.e., strength Pareto evolutionary algorithm II (SPEA-II), is developed for the burnable poison placement (BPP) optimization of a nuclear reactor core. In the BPP problem, an optimized placement map of fuel assemblies with burnable poison is searched for a given core loading pattern according to defined objectives. In this work, SPEA-II coupled with a nodal expansion code is used for solving the BPP problem of Kraftwerk Union AG (KWU) pressurized water reactor. Our optimization goal for the BPP is to achieve a greater multiplication factor ($K_{eff}$) for gaining possible longer operation cycles along with more flattening of fuel assembly relative power distribution, considering a safety constraint on the radial power peaking factor. For appraising the proposed methodology, the basic approach, i.e., SPEA, is also developed in order to compare obtained results. In general, results reveal the acceptance performance and high strength of SPEA, particularly its new version, i.e., SPEA-II, in achieving a semioptimized loading pattern for the BPP optimization of KWU pressurized water reactor.