• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.686-689
• /
• 2008

The leaning angle optimization of turbine blade using the genetic algorithm was conducted in this paper. The calculation CFD technique was based upon the Diagonalized Alternating Directional Implicit scheme(DADI) with algebraic turbulence modeling. The leaning angle of VKI turbine blade was represented using B-spline curve. The control points are the design variable. Genetic algorithm was taken into account as an optimization tool. The objective was to minimize the total pressure loss. The optimized final geometry shows the better aerodynamic performance compared with the initial turbine blade.

• Structural Engineering and Mechanics
• /
• v.55 no.6
• /
• pp.1157-1176
• /
• 2015

This study presents optimizing structural topology patterns using regularization of Heaviside function. The present method needs not filtering process to typical SIMP method. Using the penalty formulation of the SIMP approach, a topology optimization problem is formulated in co-operation, i.e., couple-signals, with design variable values of discrete elements and a regularized Heaviside step function. The regularization of discontinuous material distributions is a key scheme in order to improve the numerical problems of material topology optimization with 0 (void)-1 (solid) solutions. The weak forms of an equilibrium equation are expressed using a coupled regularized Heaviside function to evaluate sensitivity analysis. Numerical results show that the incorporation of the regularized Heaviside function and the SIMP leads to convergent solutions. This method is tested using several examples of a linear elastostatic structure. It demonstrates that improved optimal solutions can be obtained without the additional use of sensitivity filtering to improve the discontinuous 0-1 solutions, which have generally been used in material topology optimization problems.

• Steel and Composite Structures
• /
• v.47 no.3
• /
• pp.365-374
• /
• 2023

This paper presents a new scheme for constructing locking-free finite elements in thick and thin plates, called Discrete Shear Gap element (DSG), using multiphase material topology optimization for triangular elements of Reissner-Mindlin plates. Besides, common methods are also presented in this article, such as quadrilateral element (Q4) and reduced integration method. Moreover, when the plate gets too thin, the transverse shear-locking problem arises. To avoid that phenomenon, the stabilized discrete shear gap technique is utilized in the DSG3 system stiffness matrix formulation. The accuracy and efficiency of DSG are demonstrated by the numerical examples, and many superior properties are presented, such as being a strong competitor to the common kind of Q4 elements in the static topology optimization and its computed results are confirmed against those derived from the three-node triangular element, and other existing solutions.

• Steel and Composite Structures
• /
• v.50 no.3
• /
• pp.337-345
• /
• 2024

This research proposed a particle swarm optimization (PSO) based seismic retrofit design of moment frame structures using a steel frame assembly. Two full scale specimens of the steel frame assembly with different corner details were attached to one-story RC frames for seismic retrofit, and the lateral load resisting capacities of the retrofitted frames subjected to cyclic loads were compared with those of a bare RC frame. The open source software framework Opensees was used to develop an analytical model for validating the experimental results. The developed analytical model and the optimization scheme were applied to a case study structure for economic seismic retrofit design, and its seismic performance was assessed before and after the retrofit. The results show that the developed steel frame assembly was effective in increasing seismic load resisting capability of the structure, and the PSO algorithm could be applied as convenient optimization tool for seismic retrofit design of structures.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1393-1400
• /
• 2006

This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1367-1374
• /
• 2004

Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11 MAC protocol. Enhanced distributed coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has e problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can Improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.95-103
• /
• 2008

The Network Mobility (NEMO) basic support protocol extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol is not efficient to offer delays in data delivery and higher overheads in the case of nested mobile networks because it uses fairly sub-optimal routing and multiple encapsulation of data packets. In this paper, our scheme combining Hierarchical Mobile IPv6 (HMIPv6) functionality and Hierarchical Prefix Delegation (HPD) protocol for IPv6, which provide more effective route optimization and reduce packet header overhead and the burden of location registration for handoff. The scheme also uses hierarchical mobile network prefix (HMNP) assignment and tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility and intra-domain data communication. The performance is evaluated using NS-2.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4305-4323
• /
• 2014

In this paper, we investigate the degrees of freedom (DOF) of the Y channel consisting of three single-antenna users and a two-antenna common access relay, where each user intends to exchange independent messages with the other two users with the assistance of the relay. We show that the DOF of this particular scenario is 1.5. In order to prove this result, we firstly derive a DOF upper bound based on cut-set bound by allowing cooperation among users, which shows that the total DOF is upper bounded by 1.5. Then we propose a novel transmission scheme based on asymmetric signal space alignment (ASSA) to demonstrate the achievability of the upper bound. Theoretical evaluation and numerical results confirm that the upper bound can be achieved by utilizing ASSA, which also proves the optimality of the ASSA-based scheme in terms of DOF. Combining the upper bound and achievability, we conclude that the exact DOF is 1.5. Moreover, we present a novel iterative joint beamforming optimization (I-JBO) algorithm to further improve the sum rate. Numerical simulations have been provided to demonstrate the convergence speed and performance advantage of the I-JBO algorithm.

• Journal of Internet Computing and Services
• /
• v.9 no.2
• /
• pp.35-42
• /
• 2008

Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.62-69
• /
• 2005

Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11e MAC protocol. Enhanced disoibuted coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has the problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.