• Title/Summary/Keyword: node density based design

Search Result 24, Processing Time 0.025 seconds

Topological material distribution evaluation for steel plate reinforcement by using CCARAT optimizer

  • Lee, Dongkyu;Shin, Soomi;Park, Hyunjung;Park, Sungsoo
    • Structural Engineering and Mechanics
    • /
    • v.51 no.5
    • /
    • pp.793-808
    • /
    • 2014
  • The goal of this study is to evaluate and design steel plates with optimal material distributions achieved through a specific material topology optimization by using a CCARAT (Computer Aided Research Analysis Tool) as an optimizer, topologically optimally updating node densities as design variables. In typical material topology optimization, optimal topology and layouts are described by distributing element densities (from almost 0 to 1), which are arithmetic means of node densities. The average element densities are employed as material properties of each element in finite element analysis. CCARAT may deal with material topology optimization to address the mean compliance problem of structural mechanical problems. This consists of three computational steps: finite element analysis, sensitivity analysis, and optimality criteria optimizer updating node densities. The present node density based design via CCARAT using node densities as design variables removes jagged optimal layouts and checkerboard patterns, which are disadvantages of classical material topology optimization using element densities as design variables. Numerical applications that topologically optimize reinforcement material distribution of steel plates of a cantilever type are studied to verify the numerical superiority of the present node density based design via CCARAT.

A Robust Transport Protocol Based on Intra-Cluster Node Density for Wireless Sensor Networks (무선 센서 네트워크를 위한 클러스터 내 노드 밀도 기반 트랜스포트 프로토콜)

  • Baek, Cheolheon;Moh, Sangman
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.6
    • /
    • pp.381-390
    • /
    • 2015
  • The efficient design of a transport protocol contributes to energy conservation as well as performance improvement in wireless sensor networks (WSNs). In this paper, a node-density-aware transport protocol (NDTP) for intra-cluster transmissions in WSNs for monitoring physical attributes is proposed, which takes node density into account to mitigate congestion in intra-cluster transmissions. In the proposed NDTP, the maximum active time and queue length of cluster heads are restricted to reduce energy consumption. This is mainly because cluster heads do more works and consume more energy than normal sensor nodes. According to the performance evaluation results, the proposed NDTP outperforms the conventional protocol remarkably in terms of network lifetime, congestion frequency, and packet error rate.

3-D Topology Optimization by a Nodal Density Method Based on a SIMP Algorithm (SIMP 기반 절점밀도법에 의한 3 차원 위상최적화)

  • Kim, Cheol;Fang, Nan
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.412-417
    • /
    • 2008
  • In a traditional topology optimization method, material properties are usually distributed by finite element density and visualized by a gray level image. The distribution method based on element density is adequate for a great mass of 2-D topology optimization problems. However, when it is used for 3-D topology optimization, it is always difficult to obtain a smooth model representation, and easily appears a virtualconnect phenomenon especially in a low-density domain. The 3-D structural topology optimization method has been developed using the node density instead of the element density that is based on SIMP (solid isotropic microstructure with penalization) algorithm. A computer code based on Matlab was written to validate the proposed method. When it was compared to the element density as design variable, this method could get a more uniform density distribution. To show the usefulness of this method, several typical examples of structure topology optimization are presented.

  • PDF

CAD Interface using Topology Optimization (위상최적설계 결과를 이용한 CAD 인터페이스)

  • Kim, Seong-Hoon;Min, Seung-Jae;Lee, Sang-Hun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.4
    • /
    • pp.281-289
    • /
    • 2009
  • Topology optimization has been widely used for the optimal structure design for weight reduction and high performance. Since the result of three-dimensional topology optimization is represented by the discrete material distribution in finite elements, it is hard to interpret from a design point of view. In this paper, the method for interpreting three-dimensional topology optimization resuIt into a series of cross-sectional curve representation is proposed and interfaced with the existing CAD system for the practical use. The concept of node density and virtual grid is introduced to transform element density values into grid density and material boundaries in each cross section are identified based on the element volume rate to satisfy the amount of material specified in the original design intent. Design exampIes show that three-dimensional topology result can be converted into a form of curve CAD model and the seamless interface with CAD software can be achieved.

Design of UIGRP(Urban Intersection based Geographic Routing Protocol) considering the moving direction and density of vehicles (차량 이동 방향과 밀집도를 고려한 UIGRP(Urban Intersection based Geographic Routing Protocol) 설계)

  • Lee, Byung-Kwan;Jeong, Eun-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.1
    • /
    • pp.703-712
    • /
    • 2015
  • This paper proposes the UIGRP, which can tackle the problem of the network disconnection and packet transmission delay caused by turning vehicles frequently in an urban intersection. The UIGRP was designed as follows. First, it calculates the direction of vehicles using the moving direction of vehicles and the location of a destination. Second, it makes the RSU measure the density of an urban intersection. Third, the TGF Algorithm in the UIGRP decides the data transmission paths by setting as an intermediate node, not only the vehicle that is moving in the direction where a destination node is located, but also the node that has the highest density. The TGF algorithm using a moving direction and density minimizes or removes the occurrence of local maximum problems that the existing Greedy Forwarding algorithm has. Therefore, the simulation result shows that UIGRP decreases the occurrence of local maximum problems by 3 and 1 times, and the packet transmission time by 6.12 and 2.04(ms), and increases the success rate of packet transmission by 15 and 3%, compared to the existing GPSR and GPUR.

Vibration-based Damage Monitoring Scheme of Steel Girder Bolt-Connection Member by using Wireless Acceleration Sensor Node (무선 가속도 센서노드를 이용한 강 거더 볼트연결 부재의 진동기반 손상 모니터링 체계)

  • Hong, Dong-Soo;Kim, Jeong-Tae
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.25 no.1
    • /
    • pp.81-89
    • /
    • 2012
  • This study propose the vibration-based damage monitoring scheme for steel girder bolt-connection member by using wireless acceleration sensor node. In order to achieve the objective, the following approaches are implemented. Firstly, wireless acceleration sensor node is described on the design of hardware components and embedded operation software. Secondly, the vibration-based damage monitoring scheme of the steel girder bolt-connection member is described. The damage monitoring scheme performed global damage occurrence alarming and damage localization estimation by the acceleration response feature analysis. The global damage alarming is applied to the correlation coefficient of power spectral density. The damage localization estimation is applied to the frequency-based damage detection technique and the mode-shape-based damage detection technique. Finally, the performance of the vibration-based damage monitoring scheme is evaluated for detecting the bolt-connection member damage on a lab-scale steel girder.

Performance Analysis of Multi-hop Wireless Networks under Different Hopping Strategies with Spatial Diversity

  • Han, Hu;Zhu, Hongbo;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2548-2566
    • /
    • 2012
  • This paper derives two main end-to-end performance metrics, namely the spatial capacity density and the average end-to-end delay of the multi-hop wireless ad hoc networks with multi-antenna communications. Based on the closed-form expressions of these performance metrics, three hopping strategies, i.e., the closest neighbor, the furthest neighbor and the randomly selected neighbor hopping strategies have been investigated. This formulation provides insights into the relations among node density, diversity gains, number of hops and some other network design parameters which jointly determine network performances, and a method of choosing the best hopping strategy which can be formulated from a network design perspective.

Distribution of Inter-Contact Time: An Analysis-Based on Social Relationships

  • Wei, Kaimin;Duan, Renyong;Shi, Guangzhou;Xu, Ke
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.504-513
    • /
    • 2013
  • Communication in delay tolerant networks (DTNs) relies on message transport by mobile nodes, and a correct understanding of the node mobility characteristics is therefore crucial to the design of an efficient DTN routing protocol. However, previous work has mainly focused on uncovering all behaviors of node movement, which is not conducive to accurately detecting the specific movement characteristics of a different node. In this paper, we seek to address this problem based on a consideration of social relationships. We first consider social ties from both static and dynamic perspectives. For a static perspective, in addition to certain accidental events, social relations are considered for a long time granularity and tend to be stable over time. For a dynamic perspective, social relations are analyzed in a relatively short time granularity and are likely to change over time. Based on these perspectives, we adopted different efficient approaches to dividing node pairs into two classes, i.e., familiar and unfamiliar pairs. A threshold approach is used for static social ties whereas a density-based aggregation method is used for dynamic social relationships. Extensive experimental results show that both familiar and unfamiliar node pairs have the same inter-contact time distribution, which closely follows a power-law decay up to a certain point, beyond which it begins to exponentially decay. The results also demonstrate that the inter-contact time distribution of familiar pairs decays faster than that of unfamiliar pairs, whether from a static or dynamic perspective. In addition, we also analyze the reason for the difference between the inter-contact time distributions of both unfamiliar and familiar pairs.

CAD Model Construction Using Topology Optimization (위상최적설계를 이용한 CAD 모델 구축)

  • Lee, Dong-Hoon;Min, Seung-Jae;Seo, Sang-Ho
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2002.11b
    • /
    • pp.523-528
    • /
    • 2002
  • Topology optimization is widely accepted as a conceptual design tool for the product design. Since the resulted layout of the topology optimization is a kind of digital images represented by the density distribution, the seamless process is required to transform digital images to the CAD model for the practical use. In this paper, the general process to construct a CAD model is developed to apply for topology images based on elements. The node density and the morphology technique is adopted to extract boundary contour of the shape and remove the noise of images through erosion and dilation operation. The proposed method automatically generates point data sets of the geometric model. The process is integrated with Pro/Engineer, so that the engineer in practice can directly handle with curves or surface form digital images.

  • PDF

Slicing a Point Cloud (점군 절단 알고리즘)

  • Park, Hyeong-T.;Chang, Min-H.;Park, Sang-C.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.2
    • /
    • pp.146-152
    • /
    • 2007
  • Presented in the paper is an algorithm to generate a section curve by slicing a point cloud which may include tens of thousands of points. Although there are couple of previous results, they are very sensitive on the density variations and local noising points. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) avoiding local vibration, and 3) robustness on the density changes. To satisfy these requirements, we propose a new slicing algorithm which is based on a node-circle diagram. The algorithm has been implemented and tested with various examples.