• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.778-785
• /
• 2020

Wireless mesh networks consist of mesh clients, mesh routers and mesh access points. The mesh router connects wireless network services to the mesh client, and the mesh access point connects to the backbone network using a wired link and provides Internet access to the mesh client. In this paper, a limited number of mesh routers and mesh access points are used to propose optimization algorithms for network design for wireless mesh networks. The optimization algorithm in this paper has been applied with a sub-subscription algorithm, which is one of the meta-heuristic methods, and is designed to minimize the transmission delay for the placement of mesh routers and mesh access points, and produce optimal results within a reasonable time. The proposed algorithm was evaluated in terms of transmission delay and time to perform the algorithm for the placement of mesh routers and mesh access points, and the performance evaluation results showed superior performance compared to the previous meta-heuristic methods.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.8
• /
• pp.746-752
• /
• 2009

In this paper, we deal with the development of an optimal design program for a triple-band PTFA(Planar Inverted-F Antenna) of 433 MHz, 912 MHz and 2.45 GHz by using evolution strategy. Generally, the resonance frequency of the PIFA is determined by the width and length of a U-type slot used. However the resonance frequencies of the multiple U slots are varied by the mutual effect of the slots. Thus the optimal width and length of U-type slots are determined by using an optimal design program based on the evolution strategy. To achieve this, an interface program between a commercial EM analysis tool and the optimal design program is constructed for implementing the evolution strategy technique that seeks a global optimum of the objective function through the iterative design process consisting of variation and reproduction. The resonance frequencies of the triple-band PIFA yielded by the optimal design program are 430 MHz, 910.5 MHz and 2.458 GHz that show a good agreement to the design target values.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.1
• /
• pp.111-119
• /
• 2010

Many researchers have studied on the optimal seismic design with the development of the computer. So far the application structure of most researches on the optimal seismic design was almost the moment resisting frame. Because the braced frames are the representative lateral load resisting system with the moment resisting frames, it is estimated that the effect on the practice will be great if it can is provided a design guideline through the development of optimal seismic design model for the braced frames. The purpose of this study is to propose the optimal seismic design model for the inverted V-type special concentrically braced frames considering the buckling of braces. The objective functions of this are to minimize the structural weight and maximize the total dissipated energy of the structure and the constraints of this are the strength conditions for the column, beam, brace and inter-story drifts condition. To verify the proposed model, it is applied to 2D steel concentrically braced frames of 3-story and 9-story.

• Composites Research
• /
• v.35 no.5
• /
• pp.340-346
• /
• 2022

In this study, an optimal structural design of composite helicopter blades is performed using the genetic algorithm-based optimizer PSGA (Particle Swarm assisted Genetic Algorithm). The blade sections consist of the skin, spar, form, and balancing weight. The sectional geometries are generated using the B-spline curves while an opensource code Gmsh is used to discretize each material domain which is then analyzed by a finite element sectional analysis program Ksec2d. The HART II blade formed based on either C- or D-spar configuration is exploited to verify the cross-sectional design framework. A numerical simulation shows that each spar model reduces the blade mass by 7.39% and 6.65%, respectively, as compared with the baseline HART II blade case, while the shear center locations being remain close (within 5% chord) to the quarter chord line for both cases. The effectiveness of the present optimal structural design framework is demonstrated, which can readily be applied for the structural design of composite helicopter blades.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.5
• /
• pp.426-432
• /
• 2001

This paper is implementation of cellular automata neural network system using evolving hardware concept. This system is a living creatures'brain based on artificial life techniques. Cellular automata neural network system is based on the development and the evolution, in other words, it is modeled on the ontogeny and phylogney of natural living things. The phylogenetic mechanism are fundamentally non-deterministic, with the mutation and recombination rate providing a major source of diversity. Ontogeny is deterministic and local physics. Cellular automata is developed from initial cells, and evaluated in given environment. And genetic algorithms take a part in adaptation process. In this paper we implement this system using evolving hardware concept. Evolving hardware is reconfigurable hardware whose configuration si under the control of an evolutionary algorithm. We design genetic algorithm process for evolutionary algorithm and cells in cellular automata neural network for the construction of reconfigurable system. The effectiveness of the proposed system if verified by applying it to Exclusive-OR.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.8-18
• /
• 2009

CableLAB published DOCSIS 3.0 Specifications to supply broadband access to homes and small businesses. The primary technique of DOCSIS 3.0 Specification is channel bonding which provides cable operators with a flexible way to significantly increase up/downstream speeds. In this paper, we propose the upstream scheduler that serves channel bonding. Proposed scheduler consists of two sub-scheduler: bonding group scheduler and channel scheduler. Also, we propose three scheduling algorithms to allocate request bandwidth of CM to each bonding channel: equivalent scheduling algorithm, current request-based scheduling algorithm, and last grant-based scheduling algorithm. In order to evaluate the performance of these algorithms and DOCSIS 3.0 MAC protocol, we develop the DOCSIS 3.0 simulator with the network simulator, OPNET, to model DOCSIS network, CMTS, and CM. Our results show that equivalent scheduling algorithm is superior to others in the view of transmission delay and throughput and DOCSIS 3.0 protocol provides higher throughput than pre-DOCSIS 3.0 protocol.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.4
• /
• pp.51-57
• /
• 2003

The development of the communication network and the other network method can generate serious social problems. So, it is highly required to control security of network. These problems related security will be developed and keep up to confront with anti-security field such as hacking, cracking. The way to preserve security from hacker or cracker without developing new cryptographic algorithm is keeping the state of anti-cryptanalysis in a prescribed time by means of extending key-length. In this paper, we proposed M3 algorithm for the reduced processing time in the montgomery multiplication part. Proposed M3 algorithm using the matrix function M(.) and lookup table perform optionally montgomery multiplication with repeated operation. In this result, modified repeated operation part produce 30% processing rate than existed montgomery multiplicator. The proposed montgomery multiplication structured unit array method in carry generated part and variable length multiplication for eliminating bottle neck effect with the RSA cryptosystem. Therefore, this proposed montgomery multiplier enforce the real time processing and prevent outer cracking.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1919-1926
• /
• 2016

Because of the enormous processing ability, General-Purpose Graphics Processing Unit(GPGPU) has been applied to many fields including electronics design automation. The SAT algorithm is one of the core algorithm in many electronics design automation tools. There has been some efforts to apply GPGPU to the SAT algorithm, but it is difficult to parallelize the SAT algorithm because of its characteristics. In this paper, I applied GPGPU to the SAT algorithm by parallelizing the propagation routine that is relatively suitable to parallel processing. On the basis of the similarity of the propagation routine to the sparse matrix multiplication, the data structure for the SAT problem is constituted, and the parallel propagation routine is described. To prevent data loss between paralllel threads, atomic operations are exploited. The experimental results for some benchmark SAT problems show that the proposed algorithm is superior to the previous GPGPU-based SAT solver.

• Journal of the KSME
• /
• v.53 no.3
• /
• pp.46-50
• /
• 2013

이 글에서는 국내에 아직 연구가 활성화되지 못한 의사결정기반 설계 알고리즘 및 융합설계 최적화 분야에서의 최근 연구 동향을 소개하고자 한다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.13 no.3
• /
• pp.337-349
• /
• 2000

Genetic Algorithms(GA) together with simulated annealing are often called methods of last resorts since they can be applicable to any kind of problems, particularly those to which no sophisticated procedures are applicable or feasible. The design of structures is primarily the process of selecting a section for each member from those available in the market, resulting in the problem of combinatorial nature. Therefore it is usual for the design space to include astronomical number of designs making the search in the space often impossible. In this work, Genetic Algorithms and some related technique are introduced and applied to the design of steel frameworks. In problems with a small number of design variables, GA found true global optima. GA also found true optima for the continuous variable test problems and proved their applicability to structural optimization. For those problems of real size, however, it appears to be difficult to expect GA to find optimum or even near optimum designs. The use of G bit improvement added to ordinary GA has shown much better results and draws attention for further research.