• Title/Summary/Keyword: Hierarchical Grid

Search Result 79, Processing Time 0.028 seconds

A New Control Scheme of Wind Farm Considering P,Q References (풍력 발전단지의 출력 지령값을 고려한 계통 연계 운영 방안)

  • Choi, Jung-Hyun;Park, Jin-Woo;Moon, Seung-Il
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.1172-1173
    • /
    • 2008
  • At the moment, the control ability of wind farms is a prime research concern for the grid integration of large wind farms, due to their required active role in the power system. As more wind turbines are installed, the power from wind energy will start to replace conventional generation units and its influence on power systems cannot be neglected. Besides, because of the intermittent nature of wind the output power of wind turbines fluctuates according to wind speed variation. Especially an isolated power system with small capacity such like Jeju needs more systematic solutions and regulations(grid code). This paper presents the idea of approach for centralized operating wind farm strategy to regulate the wind farm power production to the reference power ordered by the system operator. The doubly fed induction generator(DFIG) can control active and reactive power in feasible range. So wind farm comprised of DFIG has the possibility of a controllable component in the power system. The presented wind farm control has a hierarchical structure with both a wind farm control level and a wind turbine control level.

  • PDF

Numerical Simulation of Flood Inundation with Quadtree Grid (사면구조 격자를 이용한 홍수범람 모의)

  • Kim, Jong-Ho;Kim, Hyung-Jun;Lee, Seung-Oh;Cho, Yong-Sik
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.7 no.2 s.25
    • /
    • pp.45-52
    • /
    • 2007
  • In this study, the flood inundations of the Nam River catchment running through the Uiryeong and Haman regions have been simulated using the numerical model based on quadtree grids. The nonlinear Saint Venant equation is employed as the governing equation for a numerical model in this study. The governing equations are discretized explicitly with a finite difference leap-frog scheme on adaptive hierarchical quadtree grids. Results from this study are compared with those of established numerical models such as the HEC-RAS and the FLUMEN. A numerical model is also simulated according to the frequency variations of flood event. Obtained numerical results show good agreements with them of commercial models. It is found from this study that the flood inundations in the studied area can be occurred at a 500 year frequency event.

Design and Evaluation of a Fault-tolerant Publish/Subscribe System for IoT Applications (IoT 응용을 위한 결함 포용 발행/구독 시스템의 설계 및 평가)

  • Bae, Ihn-Han
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.8
    • /
    • pp.1101-1113
    • /
    • 2021
  • The rapid growth of sense-and-respond applications and the emerging cloud computing model present a new challenge: providing publish/subscribe middleware as a scalable and elastic cloud service. The publish/subscribe interaction model is a promising solution for scalable data dissemination over wide-area networks. In addition, there have been some work on the publish/subscribe messaging paradigm that guarantees reliability and availability in the face of node and link failures. These publish/subscribe systems are commonly used in information-centric networks and edge-fog-cloud infrastructures for IoT. The IoT has an edge-fog cloud infrastructure to efficiently process massive amounts of sensing data collected from the surrounding environment. In this paper. we propose a quorum-based hierarchical fault-tolerant publish/subscribe systems (QHFPS) to enable reliable delivery of messages in the presence of link and node failures. The QHFPS efficiently distributes IoT messages to the publish/subscribe brokers in fog overlay layers on the basis of proposing extended stepped grid (xS-grid) quorum for providing tolerance when faced with node failures and network partitions. We evaluate the performance of QHFPS in three aspects: number of transmitted Pub/Sub messages, average subscription delay, and subscritpion delivery rate with an analytical model.

Hierarchical Voltage Control of a Wind Power Plant Using the Adaptive IQ-V Characteristic of a Doubly-Fed Induction Generator

  • Kim, Jinho;Park, Geon;Seok, Jul-Ki;Lee, Byongjun;Kang, Yong Cheol
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.2
    • /
    • pp.504-510
    • /
    • 2015
  • Because wind generators (WGs) in a wind power plant (WPP) produce different active powers due to wake effects, the reactive power capability of each WG is different. This paper proposes a hierarchical voltage control scheme for a WPP that uses a WPP controller and WG controller. In the proposed scheme, the WPP controller determines a voltage error signal by using a PI controller and sends it to a doubly-fed induction generator (DFIG). Based on the reactive current-voltage ($I_Q-V$) characteristic of a DFIG, the DFIG injects an appropriate reactive power corresponding to the voltage error signal. To enhance the voltage recovery capability, the gains of the $I_Q-V$ characteristic of a DFIG are modified depending on its reactive current capability so that a DFIG with greater reactive current capability may inject more reactive power. The proposed scheme enables the WPP to recover the voltage at the point of common coupling (PCC) to the nominal value within a short time after a disturbance by using the adaptive $I_Q-V$ characteristics of a DFIG. The performance of the proposed scheme was investigated for a 100 MW WPP consisting of 20 units of 5 MW DFIGs for small and larger disturbances. The results show the proposed scheme successfully recovers the PCC voltage within a short time after a disturbance.

A Smart Set-Pruning Trie for Packet Classification (패킷 분류를 위한 스마트 셋-프루닝 트라이)

  • Min, Seh-Won;Lee, Na-Ra;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1285-1296
    • /
    • 2011
  • Packet classification is one of the basic and important functions of the Internet routers, and it became more important along with new emerging application programs requiring real-time transmission. Since packet classification should be accomplished in line-speed on each incoming input packet for multiple header fields, it becomes one of the challenges in designing Internet routers. Various packet classification algorithms have been proposed to provide the high-speed packet classification. Hierarchical approach achieves effective packet classification performance by significantly narrowing down the search space whenever a field lookup is completed. However, hierarchical approach involves back-tracking problem. In order to solve the problem, set-pruning trie and grid-of-trie algorithms are proposed. However, the algorithm either causes excessive node duplication or heavy pre-computation. In this paper, we propose a smart set-pruning trie which reduces the number of node duplication in the set-pruning trie by the simple merging of the lower-level tries. Simulation result shows that the proposed trie has the reduced number of copied nodes by 2-8% compared with the set-pruning trie.

Location Service and Data Dissemination Protocol for Mobile Sink Groups in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크 그룹을 위한 위치 서비스와 데이터 전송 프로토콜)

  • Yoon, Min;Lee, Euisin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1431-1439
    • /
    • 2016
  • In this paper, we propose a new location service and location-based routing for data dissemination from a source to a mobile group sink in less energy consumption of the sensor node. Unlike the existing protocols, the proposed protocol uses a leader sink instead of a group area as the location information to represent a mobile sink group. The proposed protocol also uses grid leaders on virtual grid structure to support sink mobility in location service. By using a leader sink as a representative and grid leaders for mobility supporting, the proposed protocol can exploit an efficient hierarchical location service and data dissemination method without using flooding. Accordingly, the proposed protocol carries out upper layer location services and data dissemination between a leader sink and a source and lower layer location services and data dissemination between the leader sink and member sinks. Simulation results demonstrate that the proposed protocol achieves energy-efficiency.

Bayesian Test of Quasi-Independence in a Sparse Two-Way Contingency Table

  • Kwak, Sang-Gyu;Kim, Dal-Ho
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.3
    • /
    • pp.495-500
    • /
    • 2012
  • We consider a Bayesian test of independence in a two-way contingency table that has some zero cells. To do this, we take a three-stage hierarchical Bayesian model under each hypothesis. For prior, we use Dirichlet density to model the marginal cell and each cell probabilities. Our method does not require complicated computation such as a Metropolis-Hastings algorithm to draw samples from each posterior density of parameters. We draw samples using a Gibbs sampler with a grid method. For complicated posterior formulas, we apply the Monte-Carlo integration and the sampling important resampling algorithm. We compare the values of the Bayes factor with the results of a chi-square test and the likelihood ratio test.

Performance Analysis of Saturation Routing Algorithm in Non-Hierarchical Networks (비계층 통신망에서의 포화 경로 선정 알고리즘의 성능분석)

  • Park Young-Chul
    • Journal of Digital Contents Society
    • /
    • v.3 no.1
    • /
    • pp.89-99
    • /
    • 2002
  • Saturation routing algorithm is known to be an effective routing mechanism for tactical application and packet radio networks, since it minimizes the call set-up time and does not have to maintain routing tables. But, it is known that it has significant drawbacks with respect to the network efficiency, the overhead on the control messages [1]. We consider a tactical circuit-switched grid network with a maximum of tour links and two priority classes of voice traffic. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched network without increasing the call set-up time and processor loading of the algorithm.

  • PDF

Value Structure Model of the Success Factor of ITO Transition (ITO 이행단계 성공요인에 대한 가치체계모형 연구)

  • Cha, Hwan-Ju;Kim, Ja-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.41 no.1
    • /
    • pp.21-39
    • /
    • 2016
  • Although the demand for IT outsourcing (ITO) has increased recently because of the recent recession, concerns about business discontinuity in the transition phase cause companies to hesitate to adopt ITO. Therefore, a guideline to improve the prospects is needed. However, studies on the success factors of the transition phase in ITO are lacking. In this study, we develop an expert hierarchical value map (HVM) of the success of the transition phase in ITO by using cognition scientific methodologies. We empirically verify how success factors affect the success of the transition phase. Specifically, we derive an HVM of main stakeholders by using in-depth interviews and approaches, such as repertory grid technique (RGT) and laddering, based on means-end chain theory. We validate the success factors empirically through a bipolar analysis of RGT. Finally, we determine the most important cluster of success factors through cluster analysis.

A Study on the Development of a Three Dimensional Structured Finite Elements Generation Code (3차원 정렬 유한요소 생성 코드 개발에 대한 연구)

  • Kim, Jin-Whan
    • Journal of Ocean Engineering and Technology
    • /
    • v.13 no.1 s.31
    • /
    • pp.11-17
    • /
    • 1999
  • A three dimensional finite element generation code has been developed attaching simple blocks. Block can be either a quadrature or a cube depending on the dimension of a subject considered. Finite element serendipity basis functions are employed to map elements between the computational domain and the physical domain. Elements can be generated with wser defined progressive ratio for each block. For blocks to be connected properly, a block should have a consistent numbering scheme for vertices, side nodes, edges and surfaces. In addition the edge information such as the number of elements and the progressive ratio for each direction should also be checked for interfaces to have unique node numbers. Having done so, user can add blocks with little worry about the orientation of blocks, Since the present the present code has been written by a Visual Basic language, it can be developed easily for a user interactive manner under a Windows environment.

  • PDF