• Journal of the Korea Institute of Military Science and Technology
• /
• v.10 no.1
• /
• pp.44-54
• /
• 2007

In the military field, according to the MIL-STD-188-220, which is an Ad-Hoc communication protocol used for sending out or receiving data and voice smoothly among nodes in the situation that wireless communication nodes move arbitrarily, data communication is cut off because nodes can not know topology changes perpetually in the link disconnection state due to node movement in the case that transmitters do not confirm whether data is delivered to receivers or not, and transmit only the data having routine precedence continuously. In order to solve this problem, we have proposed the technique that makes efficient data communication possible by achieving a rapid topology change detection and link information update using TEST frame. We have analyzed TEST frame application effects in the two aspects of the topology update delay time and the data transmission success ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.171-192
• /
• 2017

The change of any element in the network is possible to cause performance degradation of the multicast network. So it is necessary to optimize the topology path through the multicast update strategy, which directly affects the performance and user experience of the overlay multicast. In view of the above, a new multicast tree update strategy based on perturbation theory Musp (Multicast Update Strategy based on Perturbation theory) is proposed, which reduces the data transmission interruption caused by the multicast tree update and improves user experiences. According to the multicast tree's elements performance and the topology structure, the Musp strategy defines the multicast metric matrix and based on the matrix perturbation theory it also defines the multicast fluctuation factor. Besides it also demonstrates the calculability of the multicast fluctuation factor presents the steps of the Musp algorithm and calculates the complexity. The experimental results show that compared with other update strategies, as for the sensitivity of the multicast fluctuation factor's energized multicast tree to the network disturbance, the maximum delay of the Musp update strategy is minimal in the case of the local degradation of network performance.

• Steel and Composite Structures
• /
• v.51 no.2
• /
• pp.203-223
• /
• 2024

This study shows functionally graded material structural topology optimization under buckling constraints. The SIMP (Solid Isotropic Material with Penalization) material model is used and a method of moving asymptotes is also employed to update topology design variables. In this study, the quadrilateral element is applied to compute buckling load factors. Instead of artificial density properties, functionally graded materials are newly assigned to distribute optimal topology materials depending on the buckling load factors in a given design domain. Buckling load factor formulations are derived and confirmed by the resistance of functionally graded material properties. However, buckling constraints for functionally graded material topology optimization have not been dealt with in single material. Therefore, this study aims to find the minimum compliance topology optimization and the buckling load factor in designing the structures under buckling constraints and generate the functionally graded material distribution with asymmetric stiffness properties that minimize the compliance. Numerical examples verify the superiority and reliability of the present method.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.354-359
• /
• 2007

A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, an inner-front creation algorithm is proposed, in which the sizes, positions, and number of new inner-fronts during the optimization process can be globally and consistently identified. To update the level set function during the optimization process, the least-squares finite element method is employed. As demonstrative examples for the flexibility and usefulness of the proposed method, the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.10a
• /
• pp.183-190
• /
• 2001

Topology optimization. has been evolved into a very efficient conceptual design tool and has been utilized into design engineering processes in many industrial parts. In recent years, topology optimization has become the focus of structural optimization design and has been researched and widely applied both in academy and industry. Traditional topology optimization has been using homogenization method and optimality criteria method. Homogenization method provides relationship equation between structure which includes many holes and stiffness matrix in FEM. Optimality criteria method is used to update design variables while maintaining that volume fraction is uniform. Traditional topology optimization has advantage of good convergence but has disadvantage of too much convergency time and additive checkerboard prevention algorithm is needed. In one way to solve this problem, element remove method is presented. Then, it is applied to many examples. From the results, it is verified that the time of convergence is very improved and optimal designed results is obtained very similar to the results of traditional topology using 8 nodes per element.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.13-18
• /
• 2005

Routers determine routing path considering network topology and link state information for providing QoS (quality of service) guarantee. Therefore, it is important that routers know link state information to calculate routing path. However, if routers generate link state update messages inordinately, their router performance are reduced due to the process of link state update messages. On the other side, in case that link state information is not updated appropriately, route setup requests can be rejected even though there exist routes. In this paper, we propose an algorithm to improve router performance and evaluate the proposed algorithm performance compare with conventional algorithm by simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.299-306
• /
• 1999

Considers the problem to update the spanning tree and strongly-connected components in response to topology change of the network. This paper proposes a distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(n'log n'+ (n'+s+t)) and O(n'logn') respectively where n'is the number of processors in the network after the topology change, s is the number of added links, and t is the total number of links in the strongly connected component (of the network before the topology change) including the deleted links.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.23 no.1
• /
• pp.84-91
• /
• 2013

Ultrasonic flip-chip bonding needs a precise bonding tool which delivers ultrasonic energy into chip bumps effectively to use the selected resonance mode and frequency of the horn structure. The bonding tool is excited at the resonance frequency and the input and output ports should locate at the anti-nodal points of the resonance mode. In this study, we propose new design method with topology optimization for ultrasonic bonding tools. The SIMP(solid isotropic material with penalization) method is used to formulate topology optimization and OC(optimal criteria) algorithm is adopted for the update scheme. MAC(modal assurance criterion) tracking is used for the target frequency and mode. We fabricate two prototypes of ultrasonic tools which are based on 3D optimization models after reviewing 2D and 3D topology optimization results. The prototypes are satisfied with the ultrasonic frequency and vibration amplitude as the ultrasonic bonding tools.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.1015-1018
• /
• 2006

In this paper, new topology optimization technique is proposed. It mainly uses the strain energy distributions induced by the mode shapes associated with natural frequencies of the structure and so we can implicitly consider the dynamic characteristics of the structure in the topology optimization process. The strain energy to be minimized is employed as the objective function and the initial volume of structures is adopted as the constraint function. The resizing algorithm devised from the optimality criteria method is used to update the hole size of the cell existing in each finite element. The cantilever beam problem is adopted to test the proposed techniques. From numerical test, it is found to be that the optimum topology of the cantilever produced by the proposed technique has a hugh increase of natural frequency value and the technique is very effective to maximize the fundamental frequency of the structure.