• Title/Summary/Keyword: mesh-topology

Search Result 173, Processing Time 0.03 seconds

Structural Dynamics Modification using Reduced Model for Having Non-matching Nodes (불일치 절점을 가지는 경우의 축약된 모델을 이용한 동특성 변경법)

  • Kang, Ok-Hyun;Park, Youn-Sik;Park, Young-Jin
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.830-833
    • /
    • 2005
  • SDM(Structural Dynamics Modification) is to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary(modifying) structures. In this paper, I will focus on the optimal layout of the stiffeners which are attached to the plate to maximize 1st natural frequency. Recently, a new topology method was proposed by yamazaki. He uses growing and branching tree model. I modified the growing and branching tree model. The method is designated modified tree model. To expand the layout of stiffeners, I will consider non-matching problem. The problem is solved by using local lagrange multiplier without the mesh regeneration. Moreover The CMS(Component mode synthesis) method is employed to reduce the computing time of eigen reanalysis using reduced componet models.

  • PDF

A simple limit analysis procedure for reinforced concrete slabs using rigid finite elements

  • Ahmed, H.;Gilbert, M.
    • Structural Engineering and Mechanics
    • /
    • v.84 no.1
    • /
    • pp.129-141
    • /
    • 2022
  • It has previously been proposed that the yield-line method of analysis for reinforced concrete slabs could be automated via the use of rigid finite elements, assuming all deformations occur along element edges. However, the solutions obtained using this approach can be observed to be highly sensitive to mesh topology. To address this, a revised formulation that incorporates modified yield criteria to account for the presence of non-zero shear forces at interfaces between elements is proposed. The resulting formulation remains simple, with linear programming (LP) still used to obtain solutions for problems involving Johansen's square yield criteria. The results obtained are shown to agree well with literature solutions for various slab problems involving uniform loading and a range of geometries and boundary conditions.

Bayes Stopping Rule for MAC Scheme Wireless Sensor Networks (무선 센서 망에서 MAC 방식을 위한 Bayes 중지 규칙)

  • Park, Jin-Kyung;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.7
    • /
    • pp.53-61
    • /
    • 2008
  • Consider a typical wireless sensor network in which stem nodes form the backbone network of mesh topology while each stem node together with leaf nodes in its vicinity forms a subnetwork of star topology. In such a wireless sensor network, we must heed the following when we design a MAC scheme supporting the packet delivery from a leaf node to a stem node. First, leaf nodes are usually battery-powered and it is difficult to change or recharge their batteries. Secondly, a wireless sensor network is often deployed to collect and update data periodically. Late delivery of a data segment by a sensor node causes the sink node to defer data processing and the data segment itself to be obsolete. Thirdly, extensive signaling is extremely limited and complex computation is hardly supported. Taking account of these facts, a MAC scheme must be able to save energy and support timeliness in packet delivery while being simple and robust as well. In this paper, we propose a version of ALOHA as a MAC scheme for a wireless sensor network. While conserving the simplicity and robustness of the original version of ALOHA, the proposed version of ALOHA possesses a distinctive feature that a sensor node decides between stop and continuation prior to each delivery attempt for a packet. Such a decision needs a stopping rule and we suggest a Bayes stopping rule. Note that a Bayes stopping rule minimizes the Bayes risk which reflects the energy, timeliness and throughput losses. Also, a Bayes stopping rule is practical since a sensor node makes a decision only using its own history of delivery attempt results and the prior information about the failure in delivery attempt. Numerical examples confirm that the proposed version of ALOHA employing a Bayes stopping rule is a useful MAC scheme in the severe environment of wireless sensor network.

An Energy Effective Protocol for Clustering Ad Hoc Network

  • Lee, Kang-Whan;Chen, Yun
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.117-121
    • /
    • 2008
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

Yaw Gearbox Design for 4MW Class Wind Turbine (4MW급 풍력발전기용 요 감속기 설계)

  • Lee, Hyoung-Woo;Kim, In-Hwan;Lee, Jae-Shin
    • Journal of Convergence for Information Technology
    • /
    • v.12 no.2
    • /
    • pp.142-148
    • /
    • 2022
  • In this paper, the weight reduction design of the yaw gearbox for wind turbine was performed through the finite element analysis method, and the stability was checked by performing the critical speed analysis. The weight reduction product can improve engine efficiency, save parts materials, and earn economic benefits. The yaw gearbox is lightweighted with the goal of achieving a safety rate of 1.3 or higher for wind turbine as indicated by IEC61400-1. In order to reduce the weight of the carrier, a topology optimization method was performed. The safety factor was verified by performing finite element analysis on the carrier. In addition, the housing and carrier were modeled using the finite element method, and the gear train was modeled using MASTA. For the yaw gearbox, the housing and carrier FE model and the gear train model were connected by the partial structural synthesis method to perform the rotational vibration analysis. Vibration excitation sources are mass unbalance and gear mesh frrequemcy, and as a result of the critical speed analysis, it was found that there was no resonance within the operating speed range.

A study on Dynamic Routing Protocol using Entropy-Doppler Topology (엔트로피-도플러 기법을 이용한 동적 라우팅 프로토콜에 관한 연구)

  • Chi, Sam-Hyun;Kim, Sun-Guk;Doo, Kyung-Min;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.461-465
    • /
    • 2007
  • MANET(Mobile Ad hoc Networks) is free-mobility formation of mobile nodes in the wireless networks. Generally, wireless networks has two main type of structures which Tree and Mesh. These general structure is difficult to do which connectivity, redundancy transmit and network continuant. In this paper, we would suggest a new ODDMRP(Ontology Doppler effect-based Dynamic Multicast Routing Protocol) technology for effective MANET which Ontology Doppler effect-based. ODDMRP consist of the parameters for node entropy when using Doppler effect which moving position of round node, moving time, and distribution chart in velocity also it express distance of destination node and property structure organization. It would be used to provide improvement to keep the optimal communication routing and also could be improve network stabilization, and continuation durability of connectivity.

  • PDF

A Topology Independent Heuristic Load Balancing Algorithm for Multiprocessor Environment (다중 프로세서 환경에서 연결구조에 무관한 휴리스틱 부하평형 알고리즘)

  • Song Eui-Seok;Sung Yeong-Rak;Oh Ha-Ryoung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.1
    • /
    • pp.35-44
    • /
    • 2005
  • This paper proposes an efficient heuristic load balancing algorithm for multiprocessor systems. The algorithm minimizes the number of idle links to distribute load traffic and reduces its communication cost. Each processor iteratively tries to transfer unit load to/from all neighbor processors. However, real load transfer is collectively done after all load traffic is calculated. This prevents useless traffic and thus reduces the overall load traffic. The proposed algorithm can be employed in various interconnection topologies with slight modifications. In this paper, it is applied to hypercube, mesh, k-ary n-cube and general graph environments. For performance evaluation, simulation studies are performed. The proposed algorithm and the well-known existing algorithms are implemented and compared. The results show that the proposed algorithm always balances the loads perfectly. furthermore, in comparison with the existing algorithms, it reduces the communication costs by 77%, 74% and 73% in the hypercube, the mesh, and k-ary n-cube, respectively.

A New Embedding of Pyramids into Regular 2-Dimensional Meshes (피라미드의 정방형 2-차원 메쉬로의 새로운 임베딩)

  • 장정환
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.257-263
    • /
    • 2002
  • A graph embedding problem has been studied for applications of resource allocation and mapping the underlying data structure of a parallel algorithm into the interconnection architecture of massively parallel processing systems. In this paper, we consider the embedding problem of the pyramid into the regular 2-dimensional mesh interconnection network topology. We propose a new embedding function which can embed the pyramid of height N into 2$^{N}$ x2$^{N}$ 2-dimensional mesh with dilation max{2$^{N1}$-2. [3.2$^{N4}$+1)/2, 2$^{N3}$+2. [3.2$^{N4}$+1)/2]}. This means an improvement in the dilation measure from 2$^{N}$ $^1$in the previous result into about (5/8) . 2$^{N1}$ under the same condition.condition.

Proposal of USN Configuratation and Routing Scheme Inside a Ship (선박 내 센서 노드 구성 및 라우팅 제안)

  • Lee, Seong Ro;Jeong, Min-A;Kim, Yeongeun;Min, Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.8
    • /
    • pp.660-666
    • /
    • 2014
  • In this paper, we consider a classification criteria of sensor nodes based on equipment function, and propose a routing search algorithm between node when an IP-USN is applied inside a ship. whereas a tree-type routing algorithm is applied to the limited mobile enviroment, such as engine room or machine room, a mesh-type routing alogrithm is to free mobile enviroment, such as passager corridor liviing quarters or restanrats areas. For mesh-type routing, it is necessary to maintain a seamless route path between a sink node and sensor nodes for which we consider a novel message exchange periodically. We proposed a new message, RDES message, which is issued periodically to update the topology of sensor node and check a connectivity between nodes.

Resource Allocation and IP Networking for Next Generation Military Satellite Communications System (차기 군 위성통신 체계를 위한 자원 할당 및 IP 네트워킹)

  • Noh, Hong-Jun;Go, Kwang-Chun;Lee, Kyu-Hwan;Kim, Jae-Hyun;Lim, Jae-Sung;Song, Ye-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.11
    • /
    • pp.939-954
    • /
    • 2013
  • Korean military is developing the next generation military satellite communications system in order to achieve the requirements of future military satellite communication such as high speed, high capacity, survivability, all IP networking, and on-the-move. In this paper, we survey and analyze the research interests about optimal resource allocation and IP networking such as MF-TDMA, random access, satellite IP routing, and PEP. Conventional researches have focused on the increase in channel throughput and efficiency. In addition to these measurements, we consider heterogeneous satellite terminals, full mesh topology, distributed network, anti-jamming, and the like which are the special characteristics of the next generation military satellite communications system. Based on this, we present key research issues and evaluation on the issues by simulation.