• Title/Summary/Keyword: Node Generation

Search Result 346, Processing Time 0.037 seconds

Parallel Finite Element Analysis System Based on Domain Decomposition Method Bridges (영역분할법에 기반을 둔 병렬 유한요소해석 시스템)

  • Lee, Joon-Seong;Shioya, Ryuji;Lee, Eun-Chul;Lee, Yang-Chang
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.22 no.1
    • /
    • pp.35-44
    • /
    • 2009
  • This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.

A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces (장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법)

  • Lim, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.10
    • /
    • pp.1404-1415
    • /
    • 2022
  • The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

An Efficient Routing Algorithm Based on the Largest Common Neighbor and Direction Information for DTMNs (DTMNs를 위한 방향성 정보와 최대 공동 이웃 노드에 기반한 효율적인 라우팅 프로토콜)

  • Seo, Doo Ok;Lee, Dong Ho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.1
    • /
    • pp.83-90
    • /
    • 2010
  • DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

Hybrid Communication Network Architectures for Monitoring Large-Scale Wind Turbine

  • Ahmed, Mohamed A.;Kim, Young-Chon
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.6
    • /
    • pp.1626-1636
    • /
    • 2013
  • Nowadays, a rapid development in wind power technologies is occurring compared with other renewable energies. This advance in technology has facilitated a new generation of wind turbines with larger capacity and higher efficiency. As the height of the turbines and the distance between turbines increases, the monitoring and control of this new generation wind turbines presents new challenges. This paper presents the architectural design, simulation, and evaluation of hybrid communication networks for a large-scale wind turbine (WT). The communication network of WT is designed based on logical node (LN) concepts of the IEC 61400-25 standard. The proposed hybrid network architectures are modeled and evaluated by OPNET. We also investigate network performance using three different technologies: Ethernet-based, WiFi-based, and ZigBee-based. Our network model is validated by analyzing the simulation results. This work contributes to the design of a reliable communication network for monitoring and controlling a wind power farms (WPF).

Improved Direct Method for Calculating the Closest Voltage Collapse Point and Voltage Stability Enhancement by Generation Redispatch (최단 전압붕괴점 계산을 위한 개선된 직접법과 재급전에 의한 전압안정도 향상)

  • Nam, Hae-Kon;Song, Chung-Gi;Kim, Dong-Jun
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.8
    • /
    • pp.958-964
    • /
    • 1999
  • The distance in load parameter space to the closest saddle node bifurcation (CSNB) point provides the worst case power margin to voltage instability and the left eigenvector at CSNB identifies the most effective direction to steer the system to maximize voltage stability under contingency. This paper presents an improved direct method for computing CSNB: the order of nonlinear systems equations is reduced to about twice of the size of load flow equations in contrast to about three-times in Dobson's direct method; the initial guess for the direct method is computed efficiently and robustly by combined use of continuation power flow, a pair of multiple load flow solution with Lagrange interpolation. It is also shown that voltage stability may be enhanced significantly with shift of generations in the direction of the left eigenvector at CSNB.

  • PDF

Development of Algorithm for 2-D Automatic Mesh Generation and Remeshing Technique Using Bubble Packing Method (I) -Linear Analysis- (버블패킹방법을 이용한 2차원 자동격자 생성 및 재구성 알고리듬 개발(I) -선형 해석-)

  • Jeong, Sun-Wan;Kim, Seung-Jo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.6
    • /
    • pp.1004-1014
    • /
    • 2001
  • The fully automatic algorithm from initial finite element mesh generation to remeshing in two dimensional geometry is introduced using bubble packing method (BPM) for finite element analysis. BPM determines the node placement by force-balancing configuration of bubbles and the triangular meshes are made by Delaunay triangulation with advancing front concept. In BPM, we suggest two node-search algorithms and the adaptive/recursive bubble controls to search the optimal nodal position. To use the automatically generated mesh information in FEA, the new enhanced bandwidth minimization scheme with high efficiency in CPU time is developed. In the remeshing stage, the mesh refinement is incorporated by the control of bubble size using two parameters. And Superconvergent Patch Recovery (SPR) technique is used for error estimation. To verify the capability of this algorithm, we consider two elasticity problems, one is the bending problem of short cantilever beam and the tension problem of infinite plate with hole. The numerical results indicate that the algorithm by BPM is able to refine the mesh based on a posteriori error and control the mesh size easily by two parameters.

A LOW-COST PROTOCOL IN SENSOR NETWORK UBIQUITOUS ENVIRONMENT

  • Lee Dong-heui;Cho Young-bok;Kim Dong-myung;Lee Sang-ho
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.766-769
    • /
    • 2005
  • In a ubiquitous environment made up of multiple sensors, most sensors participate in communications with limited battery, and the sensor node isn't able to participate in communications when all the battery is used up. When an existing authentication method is used for the sensor node which has to participate in a long term communication with limited battery, it creates a problem by making the length of network maintenance or sensor node's operation time relatively shorte. Therefore, a network structure where RM (Register Manager) node and AM (Authentication Manager) node are imported to solve the energy consumption problem during a communication process is presented in this thesis. This offers a low power protocol based on safety through a mutual authentication during communications. Through registration and authentication manager nodes, each sensor nodes are ensured of safety and the algorithm of key's generation, encryption/descramble and authentication is processed with faster operation speed. So the amount of electricity used up during the communications between sensor nodes has been evaluated. In case of the amount of electrical usage, an average of $34.783\%$ for the same subnet and 36.855 for communications with two different subnets, are reduced. The proposed method is a protocol which maintains the limited battery for a long time to increase the effectiveness of energy usage in sensor nodes and can also increase the participation rate of communication by sensor nodes.

  • PDF

On Managing Mobility of Mobile Nodes using an Improved Mobile IP Regional Registration in Wireless Mobile Networks (무선 이동 망에서 개선된 Mobile IP 지역 위치등록을 이용한 이동 노드의 이동성 관리)

  • 한승진;이정현
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.3
    • /
    • pp.47-54
    • /
    • 2004
  • By using wireless terminal, the number of users who wish to use the multimedia service like the Internet as well as Short Message Services and voice service has increased dramatically over the last years. We propose the method that improves Mobile IPv4 (MIPv4) Regional Registration in wireless mobile networks to decrease traffic's transmission delay and message generation compared with an existing method We design the scheme in MIPv4 environments that a packet do not pass through the home agent transmitted from correspondent node to mobile node, if a mobile node moves to other mobility agent. Simulation results show that the proposed method significantly reduces the expenses for registration and delivering packet.

Automated Mesh Generation For Finite Element Analysis In Metal Forming (소성 가공의 유한 요소 해석을 위한 자동 요소망 생성)

  • 이상훈;오수익
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1997.10a
    • /
    • pp.17-23
    • /
    • 1997
  • In the two-dimensional Finite Element Method for forming simulation, mesh generation and remeshing process are very significant. In this paper, using the modified splitting mesh generation algorithm, we can overcome the limitation of existing techniques and acquire mesh, which has optimal mesh density. A modified splitting algorithm for automatically generating quadrilateral mesh within a complex domain is described. Unnecessary meshing process for density representation is removed. Especially, during the mesh generation with high gradient density like as shear band representation, the modified mesh density scheme, which will generate quadrilateral mesh with the minimized error, which takes effect on FEM solver, is introduced.

  • PDF