• 한국전산구조공학회논문집
• /
• 제22권1호
• /
• pp.35-44
• /
• 2009

본 논문에서는 대규모 3차원 구조해석에 필요한 병렬 유한요소해석을 위한 영역분할법의 적용에 대해 묘사하였다. 영역분할법을 사용한 병렬 유한요소법 시스템을 개발하였다. 절점 생성시, 절점들간의 거리가 특정절점에서의 공간함수와 같아지면 절점이 생성되어 진다. 이 절점공간함수는 퍼지지식처리에 의해 조절되어 진다. 기본적인 요소생성은 데로우니 삼각화 기법을 적용하였다. 자동요소생성 시스템을 이용한 영역분할법은 3차원 해석에 큰 도움이 된다. 공간함수와 유사하게 절점들간의 유한요소해석을 위한 병렬 수치 알고리즘으로서 영역분할법을 전체의 해석영역을 완전히 여러 개의 작은 영역으로 겹치지 않게 나누는 공역구배인 반복적 솔버와 결합시켰다. 개발된 시스템의 효용성에 대한 성능을 몇 가지 예를 통해 제시하였다.

• 한국멀티미디어학회논문지
• /
• 제25권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.679-681
• /
• 2021

본 연구애서는 노후된 태양광 발전 설비를 진단하기 위한 센서 노드와 RTU (remote terminal unit) 사이의 통신 프로토콜을 제안하였다.

• 디지털산업정보학회논문지
• /
• 제6권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.

• Journal of Electrical Engineering and Technology
• /
• 제8권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).

• 대한전기학회논문지:전력기술부문A
• /
• 제48권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.

• 대한기계학회논문집A
• /
• 제25권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.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• 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.

• 전자공학회논문지CI
• /
• 제41권3호
• /
• pp.47-54
• /
• 2004

무선 단말기를 이용하여 단순한 문장 및 음성 전송뿐만 아니라 인터넷과 같은 멀티미디어 서비스를 이용하고자 하는 사용자가 증가하고 있다. 본 논문에서는 무선 이동 망에서 Mobile IPv4 지역 위치등록(Regional Registration)을 개선하여 트래픽의 전송 지연과 메시지 발생양을 기존의 방법에 비해 낮출 수 있는 방안을 제안한다. 제안하는 방법은 CN으로부터 전송되는 패킷을 HA를 경유하지 않고 MN이 위치한 지역으로 전달하도록 한다. 본 논문에서는 각 방법에 대해 메시지 발생양과 패킷의 지연시간과의 관계를 보이고, 개선된 MIPv4 지역 위치등록을 이용하여 이를 최소화한다. 본 논문에서 제안하는 방법을 위치 등록 비용과 메시지전송 비용에 대해 기존의 방법과 비교하여 본 논문에서 제안하는 방법이 우수하다는 것을 입증한다.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1997년도 추계학술대회논문집
• /
• 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.