• Journal of Korea Multimedia Society
• /
• v.18 no.4
• /
• pp.499-505
• /
• 2015

Security supports are a significant factor in the design of mobile ad hoc networks. In the dynamic topology where the node changes frequently, private key generation and revocation for newly joining and leaving nodes must be considered. In addition, the identities of individual nodes must be protected as well in mobile networks to avoid personal privacy concerns. This paper proposes ID-based private key revocation scheme and non-interactive key agreement scheme in anonymous MANETs. The proposed scheme provides the user privacy using pseudonyms and private key generation and revocation schemes with consideration of dynamic user changes. Therefore, our schemes can be applied in dynamic and privacy-preserving MANETs which are helpful to share multimedia data.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.264-268
• /
• 2007

This article presents the performance evaluation case study of circuit-switched WCDMA R5MSC(Mobile Switching Center) Server and CS-MGW(Circuit Switched Media Gateway) in 3'rd generation mobile telecommunication (UMTS : Universal Mobile Telecommunication System). The presented work adopted circuit switching scenarios recommended by 3GPP(Third Generation Partnership Project) and terrestrial spectrum calculation parameters and its values defined in ITU-R M.2023 and M.1390 to do the case study on performance evaluation of circuit switched system (R5 MSC Server and CS-MGW) in WCDMA core network. This paper describes test results by using simulator which substitutes for wireless section (MS, Node-B, RNC).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.17-33
• /
• 2000

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.100-103
• /
• 1996

Presented in this study is an algorithmic procedure to obtain polyhedral model from a compound surface. The compound surface in this study denotes a collection of trimmed surfaces without topological relations. The procedure consists of two main modules: CAD data interface, and surface conversion to polyhedral model. The interface module gets geometric information from CAD databases, and makes topological information by scanning the geometric information. We are investigating CATIA system as a data source system. In the surface conversion module, a shell(compound surface with topological information) is approximated to a triangular-faceted polyhedral surface model through node sampling and triangulation steps. The obtained polyhedral model should obey the vertex-to-vertex rule and meet tolerance requirements. Since the polyhedral model has a simple data structure and geometry processing for it is very efficient and robust, the polyhedral model can be used in various applications, such as surface rendering in computer graphics, FEM model for engineering analysis, CAPP for surface machining, data generation for SLA, and NC tool path generation.

• Design & Manufacturing
• /
• v.7 no.1
• /
• pp.34-39
• /
• 2013

The finite element method(FEM) presents some limitations when the mesh becomes highly distorted. For analysis of metal forming processes with large deformation, the conventional finite element method usually requires several remeshing operations due to severe mesh distortion. The new computational method developed in the recent years, usually designated by meshfree method, offers an attractive approach to avoid those time-consuming remeshing efforts. This new method uses a set of points to represent the problem domain with no need of an additional mesh. Also this new generation of computational method provides a higher rate of convergence than that of the conventional finite element methods. One of the promising applications of meshfree methods is the adaptive refinement for problems having multi-scale nature. In this study, an adaptive node generation procedure is proposed and also to illustrate the efficiency of proposed method, several numerical examples are presented.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2001.04a
• /
• pp.77-80
• /
• 2001

The element-free Galerkin (EFG) method is one of meshless methods, which is an efficient method of modeling problems of fluid or solid mechanics with complex boundary shapes and large changes in boundary conditions. This paper discusses the theory of the EFG method and its applications to modeling of groundwater flow. In the EFG method, shape functions are constructed based on the moving least square (MLS) approximation, which requires only set of nodes. The EFG method can eliminate time-consuming mesh generation procedure with irregular shaped boundaries because it does not require any elements. The coupled EFG-FEM technique was introduced to treat Dirichlet boundary conditions. A computer code EFGG was developed and tested for the problems of steady-state and transient groundwater flow in homogeneous or heterogeneous aquifers. The accuracy of solutions by the EFG method was similar to that by the FEM. The EFG method has the advantages in convenient node generation and flexible boundary condition implementation.

• Transactions of Materials Processing
• /
• v.13 no.4
• /
• pp.334-341
• /
• 2004

In this study, a remeshing algorithm adapted to the mesh density map using the Delaunay mesh generation method is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on because of discrete property of the finite elements and distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical error will be highly increased. However, it is not desirable to use a uniformly fine mesh in the whole domain. Therefore, it is necessary to reduce the analysis error by constructing locally refined mesh at the region where the error is concentrated such as at the die corner. In this paper, the point insertion algorithm is used and the mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. An optimized smoothing technique is adopted to have smooth distribution of the mesh and improve the mesh element quality.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.726-729
• /
• 1991

In this paper it is discussed about the program which makes automatically the preprocessing data on the graphic editor of PC monitor. Three kinds of colors are used in order to make know a boundary_element, in_element, out_element. By initial mesh generation, three kinds of elements are made; the element with three nodes, four nodes, five nodes. The node of boundary element draw a vertical line to the boundary. At that time the element with three nodes is removed and the element with four nodes is changed to the element with four nodes. The domain graphic on this paper is compose of piecewise curves which has many lines and a hole. The data of element is written on the memory of PC computer. The program controls the memory address according to the change of element's quantity; disappearance and addition of element. All this work is operated on the PC computer.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• pp.419-420
• /
• 2006

This paper deals with a hex-dominant mesh generation using an advancing front method for three-dimensional geometries. Hexahedral and prismatic meshes are generated inwardly by offsetting from initial boundary mesh. When the meshes intersect with each other after offsetting, overlapped meshes are improved by node relocation method. In order to generate conforming mesh, pyramid elements are inserted between hexahedral and tetrahedral elements. Sample meshes fur several geometries are presented and analized to demonstrate the effectiveness of the proposed algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.4
• /
• pp.451-460
• /
• 2007

The surface of 3D shell structure is created by using NURBS and nodes for generating finite element mesh on the surface are created by using external node offset method. In so doing the shortest distance between nodes on the top and bottom surface is searched and then the coordinates of nodes are determined by calculating the mid point of them in the middle of top and bottom surface. Triangular elements are formed on mid surface, and the average aspect ratio of the generated triangular elements are over 0.9.