• Title/Summary/Keyword: Balancing Simulation

Search Result 467, Processing Time 0.029 seconds

Hierarchical Control Scheme for Three-Port Multidirectional DC-DC Converters in Bipolar DC Microgrids

  • Ahmadi, Taha;Hamzeh, Mohsen;Rokrok, Esmaeel
    • Journal of Power Electronics
    • /
    • v.18 no.5
    • /
    • pp.1595-1607
    • /
    • 2018
  • In this paper, a hierarchical control strategy is introduced to control a new three-port multidirectional DC-DC converter for integrating an energy storage system (ESS) to a bipolar DC microgrid (BPDCMG). The proposed converter provides a voltage-balancing function for the BPDCMG and adjusts the states of charge (SoC) of the ESS. Previous studies tend to balance the voltage of the BPDCMG buses with active sources or by transferring power from one bus to another. Furthermore, the batteries available in BPDCMGs were charged equally by both buses. However, this power sharing method does not guarantee efficient operation of the whole system. In order to achieve a higher efficiency and lower energy losses, a triple-layer hierarchical control strategy, including a primary droop controller, a secondary voltage restoration controller and a tertiary optimization controller are proposed. Thanks to the multi-functional operation of the proposed converter, its conversion stages are reduced. Furthermore, the efficiency and weight of the system are both improved. Therefore, this converter has a significant capability to be used in portable BPDCMGs such as electric DC ships. The converter modes are analyzed and small-signal models of the converter are extracted. Comprehensive simulation studies are carried out and a BPDCMG laboratory setup is implemented in order to validate the effectiveness of the proposed converter and its hierarchical control strategy. Simulation and experimental results show that using the proposed converter mitigates voltage imbalances. As a result, the system efficiency is improved by using the hierarchical optimal power flow control.

Uniform Load Distribution Using Sampling-Based Cost Estimation in Parallel Join (병렬 조인에서 샘플링 기반 비용 예측 기법을 이용한 균등 부하 분산)

  • Park, Ung-Gyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1468-1480
    • /
    • 1999
  • In database systems, join operations are the most complex and time consuming ones which limit performance of such system. Many parallel join algorithms have been proposed for the systems. However, they did not consider data skew, such as attribute value skew (AVS) and join product skew (JPS). In the skewness environments, performance of framework for a uniform load distribution and an efficient parallel join algorithm using the framework to handle AVS and JPS. In our algorithm, we estimate data distributions of input and output relations of join operations using the sampling methodology and evaluate join cost for the estimated data distributions. Finally, using the histogram equalization method we distribute data among nodes to achieve good load balancing among nodes in the local joining phase. For performance comparison, we present simulation model of our algorithm and other join algorithms and present the result of some simulation experiments. The results indicate that our algorithm outperforms other algorithms in the skewed case.

  • PDF

A Fair Flow Control For Baggage Handling System in Airport (공항 수하물 처리시스템의 균형적인 흐름제어 기법 연구)

  • Kim, Junbeom;Kim, Gukhwa;Chae, Junjae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1317-1327
    • /
    • 2016
  • The baggage handling system (BHS) is one of the most complex system in the airport. A highly economical operating system is required to ensure its performance in consideration of its enormous cost on the extension. Furthermore, the inefficient operation deteriorates not only the system performance but the imbalance among the check-in counters because of a bottleneck on the conveyors downstream. The objective of this research is to improve the performance of both the BHS and the check-in area by efficiently controlling the flow in the merging area on the conveyors. Thus, we suggest a control logic of which the concept is borrowed from data networks. The simulation is used to analyze impacts of the conveyors bottleneck on the check-in area and optimize some parameters used in the suggested logic. We also discuss some observations from the simulation results into several aspects of performance measures.

Design Optimization Simulation of Superconducting Fault Current Limiter for Application to MVDC System (MVDC 시스템의 적용을 위한 초전도 한류기의 설계 최적화 시뮬레이션)

  • Seok-Ju Lee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.29 no.3
    • /
    • pp.41-49
    • /
    • 2024
  • In this paper, we validate simulation results for the design optimization of a Superconducting Fault Current Limiter (SFCL) intended for use in Medium Voltage Direct Current systems (MVDC). With the increasing integration of renewable energy and grid connections, researchers are focusing on medium-voltage systems for balancing energy in new and renewable energy networks, rather than traditional transmission or distribution networks. Specifically, for DC distribution networks dealing with fault currents that must be rapidly blocked, current-limiting systems like superconducting current limiters offer distinct advantages over the operation of DC circuit breakers. The development of such superconducting current limiters requires finite element analysis (FEM) and an extensive design process before prototype production and evaluation. To expedite this design process, the design outcomes are assimilated using a Reduced Order Model (ROM). This approach enables the verification of results akin to finite element analysis, facilitating the optimization of design simulations for production and mass production within existing engineering frameworks.

An Energy-Efficient Clustering Using Load-Balancing of Cluster Head in Wireless Sensor Network (센서 네트워크에서 클러스터 헤드의 load-balancing을 통한 에너지 효율적인 클러스터링)

  • Nam, Do-Hyun;Min, Hong-Ki
    • The KIPS Transactions:PartC
    • /
    • v.14C no.3 s.113
    • /
    • pp.277-284
    • /
    • 2007
  • The routing algorithm many used in the wireless sensor network features the clustering method to reduce the amount of data transmission from the energy efficiency perspective. However, the clustering method results in high energy consumption at the cluster head node. Dynamic clustering is a method used to resolve such a problem by distributing energy consumption through the re-selection of the cluster head node. Still, dynamic clustering modifies the cluster structure every time the cluster head node is re-selected, which causes energy consumption. In other words, the dynamic clustering approaches examined in previous studies involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. In order to resolve the energy consumption problem associated with the repetitive set-up, this paper proposes the Round-Robin Cluster Header (RRCH) method that fixes the cluster and selects the head node in a round-robin method The RRCH approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.

A Load Balancing Method using Partition Tuning for Pipelined Multi-way Hash Join (다중 해시 조인의 파이프라인 처리에서 분할 조율을 통한 부하 균형 유지 방법)

  • Mun, Jin-Gyu;Jin, Seong-Il;Jo, Seong-Hyeon
    • Journal of KIISE:Databases
    • /
    • v.29 no.3
    • /
    • pp.180-192
    • /
    • 2002
  • We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

Load Balancing Mechanisms for Foreign Agents in Hierarchical Mobile IPv4 Networks (계층적 MIPv4 네트워크에서의 외부 에이전트 부하 분산 방안)

  • Byun Haesun;Lee Meejeong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.2
    • /
    • pp.167-179
    • /
    • 2005
  • In hierarchical Mobile IPv4 Networks the highest FA(Foreign Agent) may experience serious congestion and delay since the highest FA plays a role of CoA(Care of Address) for all mobile nodes in the domain, In this paper, we propose mechanism called 'HRFA(Hierarchical Root Foreign Agent)', which distributes the load imposed on the highest FA. In the proposed HRFA scheme, multiple HRFAs are selected to provide the similar service that is provided by the highest FA. According to which entity determines HRFAs, HRFA scheme is categorized into 'Active' and 'Passive' approaches. HRFA scheme is further categorized into 'All MN(Mobile Node)s' and 'New MNs' approaches, depending on which mobile nodes are assigned to a newly elected HRFA. Through a course of simulations, we investigate the performance of 4 possible combinations of HRFA schemes. We also compare the performance of the proposed HRFA schemes with the LMSP(Local Multicast Service Provider) scheme, which is a scheme to distribute the load of FA for multicast service in hierarchical wireless network domain. The simulation results show that the Passive & New MN approach performs best with respect to both the overhead and the load balancing.

A Tree-Based Routing Algorithm Considering An Optimization for Efficient Link-Cost Estimation in Military WSN Environments (무선 센서 네트워크에서 링크 비용 최적화를 고려한 감시·정찰 환경의 트리 기반 라우팅 알고리즘에 대한 연구)

  • Kong, Joon-Ik;Lee, Jae-Ho;Kang, Ji-Heon;Eom, Doo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.637-646
    • /
    • 2012
  • Recently, Wireless Sensor Networks (WSNs) are used in many applications. When sensor nodes are deployed on special areas, where humans have any difficulties to get in, the nodes form network topology themselves. By using the sensor nodes, users are able to obtain environmental information. Due to the lack of the battery capability, sensor nodes should be efficiently managed with energy consumption in WSNs. In specific applications (e.g. in intrusion detections), intruders tend to occur unexpectedly. For the energy efficiency in the applications, an appropriate algorithm is strongly required. In this paper, we propose tree-based routing algorithm for the specific applications, which based on the intrusion detection. In addition, In order to decrease traffic density, the proposed algorithm provides enhanced method considering link cost and load balance, and it establishes efficient links amongst the sensor nodes. Simultaneously, by using the proposed scheme, parent and child nodes are (re-)defined. Furthermore, efficient routing table management facilitates to improve energy efficiency especially in the limited power source. In order to apply a realistic military environment, in this paper, we design three scenarios according to an intruder's moving direction; (1) the intruder is passing along a path where sensor nodes have been already deployed. (2) the intruders are crossing the path. (3) the intruders, who are moving as (1)'s scenario, are certainly deviating from the middle of the path. In conclusion, through the simulation results, we obtain the performance results in terms of latency and energy consumption, and analyze them. Finally, we validate our algorithm is highly able to adapt on such the application environments.

Load Balancing of Unidirectional Dual-link CC-NUMA System Using Dynamic Routing Method (단방향 이중연결 CC-NUMA 시스템의 동적 부하 대응 경로 설정 기법)

  • Suh Hyo-Joon
    • The KIPS Transactions:PartA
    • /
    • v.12A no.6 s.96
    • /
    • pp.557-562
    • /
    • 2005
  • Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

The Study of the Design and Control for the Hydrogen Recirculation Blower Noise and Vibration Reduction (수소 재순환 블로어 소음 진동 저감을 위한 설계 및 제어에 관한 연구)

  • Bae, Ho June;Ban, Hyeon Seok;Noh, Yong Gyu;Jang, Seok Yeong;Lee, Hyun Joon;Kim, Chi Myung;Park, Yong Sun
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.25 no.5
    • /
    • pp.509-515
    • /
    • 2014
  • At the fuel processing system (FPS) of fuel cell vehicle, hydrogen recirculation blower (HRB) is used for the recirculation of remained hydrogen after reaction. In this paper, noise and vibration improvement of HRB is studied by changing design and control. It is checked the campbell diagram and critical speed for stability of rotor, and housing stiffness is improved using simulation of frequency response function (FRF). A method is suggested that can decrease the unbalance amount of the rotor and impeller which main source of noise and vibration. In order to reduce the noise during deceleration of blower, electrical braking is applied and tested the risk impact of durability. Founded the optimum switching frequency of the motor control, and reduced the idle rpm by increasing of aerodynamic performance. The superiority of paper is proved by measurement of the improved product's noise and vibration.