• Title/Summary/Keyword: Topology processing

Search Result 271, Processing Time 0.024 seconds

A Current Dynamic Analysis Based Open-Circuit Fault Diagnosis Method in Voltage-Source Inverter Fed Induction Motors

  • Tian, Lisi;Wu, Feng;Shi, Yi;Zhao, Jin
    • Journal of Power Electronics
    • /
    • v.17 no.3
    • /
    • pp.725-732
    • /
    • 2017
  • This paper proposed a real-time, low-cost, fast transistor open-circuit fault diagnosis method for voltage-source inverter fed induction motors. A transistor open-circuit changes the symmetry of the inverter topology, leading to different similarities among three phase load currents. In this paper, dynamic time warping is proposed to describe the similarities among load currents. The proposed diagnosis is independent of the system model and needs no extra sensors or electrical circuits. Both simulation and experimental results show the high efficiency of the proposed fault diagnosis method.

A Taxonomy of Location Management in Mobile Ad Hoc Networks

  • Galluccio, Laura;Palazzo, Sergio
    • Journal of Communications and Networks
    • /
    • v.6 no.4
    • /
    • pp.397-402
    • /
    • 2004
  • Location management is difficult in ad hoc networks due to many features such as the lack of a wired infrastructure, the scarce energy, memory and processing capabilities of nodes, and nodes’ movement which leads to a dynamic topology. These characteristics make the location management schemes designed for mobile cellular networks inefficient for ad hoc networks. New solutions for location management have therefore been proposed in the literature in the recent past. In this paper, a taxonomy of location management strategies is presented; some of the more interesting approaches proposed in the literature are critically discussed, highlighting their advantages and disadvantages.

FST : Fusion Rate Based Spanning Tree for Wireless Sensor Networks (데이터 퓨전을 위한 무선 센서 네트워크용 스패닝 트리 : FST)

  • Suh, Chang-Jin;Shin, Ji-Soo
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.83-90
    • /
    • 2009
  • Wireless Sensor Network (WSN) is a wireless network that gathers information from remote area with autonomously configured routing path. We propose a fusion based routing for a 'convergecast' in which all sensors periodically forward collected data to a base station. Previous researches dealt with only full-fusion or no-fusion case. Our Fusion rate based Spanning Tree (FST) can provide effective routing topology in terms of total cost according to all ranges of fusion rate f ($0{\leq}f{\leq}1$). FST is optimum for convergecast in case of no-fusion (f = 0) and full-fusion (f = 1) and outperforms the Shortest Path spanning Tree (SPT) or Minimum Spanning Tree (MST) for any range of f (0 < f < 1). Simulation of 100-node WSN shows that the total length of FST is shorter than MST and SPT nearby 31% and 8% respectively in terms of topology lengths for all range of f. As a result, we confirmed that FST is a very useful WSN topology.

Modified LEACH Protocol improving the Time of Topology Reconfiguration in Container Environment (컨테이너 환경에서 토플로지 재구성 시간을 개선한 변형 LEACH 프로토콜)

  • Lee, Yang-Min;Yi, Ki-One;Kwark, Gwang-Hoon;Lee, Jae-Kee
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.311-320
    • /
    • 2008
  • In general, routing algorithms that were applied to ad-hoc networks are not suitable for the environment with many nodes over several thousands. To solve this problem, hierarchical management to these nodes and clustering-based protocols for the stable maintenance of topology are used. In this paper, we propose the clustering-based modified LEACH protocol that can applied to an environment which moves around metal containers within communication nodes. In proposed protocol, we implemented a module for detecting the movement of nodes on the clustering-based LEACH protocol and improved the defect of LEACH in an environment with movable nodes. And we showed the possibility of the effective communication by adjusting the configuration method of multi-hop. We also compared the proposed protocol with LEACH in four points of view, which are a gradual network composition time, a reconfiguration time of a topology, a success ratio of communication on an containers environment, and routing overheads. And to conclude, we verified that the proposed protocol is better than original LEACH protocol in the metal containers environment within communication of nodes.

A New Three Winding Coupled Inductor-Assisted High Frequency Boost Chopper Type DC-DC Power Converter with a High Voltage Conversion Ratio

  • Ahmed Tarek;Nagai Shinichiro;Hiraki Eiji;Nakaoka Mutsuo
    • Journal of Power Electronics
    • /
    • v.5 no.2
    • /
    • pp.99-103
    • /
    • 2005
  • In this paper, a novel circuit topology of a three-winding coupling inductor-assisting a high-frequency PWM boost chopper type DC-DC power converter with a high boost voltage conversion ratio and low switch voltage stress is proposed for the new energy interfaced DC power conditioner in solar photovoltaic and fuel cell generation systems. The operating principle in a steady state is described by using its equivalent circuits under the practical condition of energy processing of a lossless capacitive snubber. The newly-proposed power MOSFET boost chopper type DC-DC power converter with the three-winding coupled inductor type transformer and a single lossless capacitor snubber is built and tested for an output power of 500W. Utilizing the lower voltage and internal resistance power MOSFET switch in the proposed PWM boost chopper type DC-DC power converter can reduce the conduction losses of the active power switch compared to the conventional model. Therefore, the total actual power conversion efficiency under a condition of the nominal rated output power is estimated to be 81.1 %, which is 3.7% higher than the conventional PWM boost chopper DC power conversion circuit topology.

Experimental Analysis of Algorithms of Splitting and Connecting Snake for Extracting of the Boundary of Multiple Objects (복수객체의 윤곽추출을 위한 스네이크 분리 및 연결 알고리즘의 실험적 분석)

  • Cui, Guo;Hwang, Jae-Yong;Jang, Jong-Whan
    • The KIPS Transactions:PartB
    • /
    • v.19B no.4
    • /
    • pp.221-224
    • /
    • 2012
  • The most famous algorithm of splitting and connecting Snake for extracting the boundary of multiple objects is the nearest method using the distance between snake points. It often can't split and connect Snake due to object topology. In this paper, its problem was discussed experimentally. The new algorithm using vector between Snake segment is proposed in order to split and connect Snake with complicated topology of objects. It is shown by experiment of two test images with 3 and 5 objects that the proposed one works better than the nearest one.

Overlay Multicast using Geographic Information in MANET (MANET에서의 지리 정보를 이용한 오버레이 멀티캐스트)

  • Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.14C no.4
    • /
    • pp.359-364
    • /
    • 2007
  • Current researches on the overlay multicast mechanism in the mobile ad hoc network (MANET) maintain the network topology information of the dynamically changing MANET, which may cause severe overhead. In this paper, we propose a new overlay multicast mechanism, the region-based overlay multicast in MANET(ROME), using the geometric locations of group members. In ROME, the physical topology is divided into small regions and the scope of location updates of group members is limited to a single region. ROME provides scalability by using the coordinate of the center point of a destination region as the destination of a data packet instead of the list of member addresses of that region. Our simulation results show that ROME gives better performance in terms of the packet overhead than other schemes.

A Study on Data Processing Methodology of Picking System using Zigbee Wireless Communication (지그비 무선 통신을 이용한 피킹 시스템의 데이터 처리방안에 관한 연구)

  • Kim, Young-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.6
    • /
    • pp.269-274
    • /
    • 2013
  • In this paper, we propose the design and implementation method of picking system using zigbee wireless communication in order to solve problems of the conventional picking system which has expensive labors and maintenance costs. We use multi router based star-tree topology as a default routing topology to provide the reliable data transmission and define the method of ID configuration and data transmission. We confirm that successful data transmission ratio of multi router based picking system is maximum 20% higher than that of single router based picking system.

A ZRP-based Reliable Route Discovery Scheme in Ad-Hoc Networks (애드혹 네트워크에서 ZRP를 기반으로 하는 경로 탐색 기법)

  • Kim, Kyoung-Ja;Chang, Tae-Mu
    • The KIPS Transactions:PartC
    • /
    • v.11C no.3
    • /
    • pp.293-300
    • /
    • 2004
  • Ad hoc networks are groups of mobile hosts without any fixed infrastructure. Frequent changes in network topology owing to node mobility make these networks very difficult to manage. Therefore, enhancing the reliability of routing paths in ad hoc networks gets more important. In this paper, we propose a ZRP(Zone Routing Protocol)-based route discovery scheme that can not only reduce the total hops of routing path, but Improve security through authentications between two nodes. And to solve the problem in maintenance of routing paths owing to frequent changes of the network topology, we adopt a query control mechanism. The effectiveness of our scheme is shown by simulation methods.

Development of the Contingency Analysis Program of Korean Energy Management System (한국형 에너지 관리시스템용 상정고장 해석프로그램 개발)

  • Cho, Yoon-Sung;Yun, Sang-Yun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.2
    • /
    • pp.232-241
    • /
    • 2010
  • This paper describes the development of robust contingency analysis program for Korean Energy Management System. The important function of contingency analysis is to determine the bus/branch model for contingency, and to calculate the state of the power network based on the network model and topology output. In the proposed method, the bus/branch models for contingencies are determined exactly using a fast linked-list method based on the application common model database. To calculate the state of the power system included contingency, the full-decoupled powerflow approach, the partial powerflow method for contingencies and the proposed contingency screening algorithm are also used to contingency analysis. To verify the performance of the developed processor, we performed a file-based test using several structured input data and online test using the database which resides on memory. The results of these comprehensive tests showed that the developed processors can accurately calculate the power system contingency state from online data and can be applied to Korea Power Exchange system.