• Title/Summary/Keyword: distance relay algorithm

Search Result 71, Processing Time 0.038 seconds

A Digital Distance Relaying Algorithm in Combined Transmission Line Connected whth Overhead Line and Underground Cable (가공송전선로와 지중송전선로가 연계된 혼합송전선로에서 디지털 거리계전 알고리즘)

  • Ha, Che-Wung;Lee, Jong-Beom
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.440-442
    • /
    • 2000
  • This paper describes the digital distance algorithm in case of combined transmission line connected with overhead line and underground cable. Actually as fault is occurred in cable, it results in the complicated phenomena due to the several kind of grounding method in the sheath of cable. Accordingly the impedance. Therefore the correct impedance calculation algorithm is requested in combined transmission line to avoid the wrong trip of relay. This paper presents the development result of impedance calculation algorithm In such transmission line.

  • PDF

Using Distance Relaying Algorithm Using Reflection Coefficients Estimation (반사계수 추정에 의한 초고속 거리계전 알고리즘)

  • Jung, Byung-Tae;Cho, Kyung-Rae;Hong, Jun-Hee;Jeong, Hae-Seong;Park, Jong-Keun
    • Proceedings of the KIEE Conference
    • /
    • 1994.11a
    • /
    • pp.36-38
    • /
    • 1994
  • A novel UHS relaying algorithm using reflection coefficients estimation is proposed. Based on a travelling ware approach the algorithm can determine the fault location in a travelling time of the protected lone. The discrimation of the reflected wave from others is possible observing the difference of two coefficients. The algorithm is tested using results determined by EMTP.

  • PDF

Development of Asynchronous Blocking Algorithm through Asynchronous Case Study of Steam Turbine Generator (스팀터빈 발전기 비동기 투입 사례연구를 통한 비동기 방지 알고리즘 개발)

  • Lee, Jong-Hweon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.10
    • /
    • pp.1542-1547
    • /
    • 2012
  • Asynchronous phenomenon occurs on the synchronous generators under power system when a generator's amplitude of electromagnetic force, phase angle, frequency and waveform etc become different from those of other synchronous generators which can follow instantly varying speed of turbine. Because the amplitude of electromagnetic force, phase frequency and waveform differ from those of other generators with which are to be put into parallel operation due to the change of excitation condition for load sharing and the sharing load change, if reactive current in the internal circuit circulates among generators, the efficiency varies and the stator winding of generators are overheated by resistance loss. When calculation method of protection settings and logic for protection of generator asynchronization will be recommended, a distance relay scheme is commonly used for backup protection. This scheme, called a step distance protection, is comprised of 3 steps for graded zones having different operating time. As for the conventional step distance protection scheme, zone 2 can exceed the ordinary coverage excessively in case of a transformer protection relay especially. In this case, there can be overlapped protection area from a backup protection relay and, therefore, malfunctions can occur when any fault occurs in the overlapped protection area. Distance relays and overcurrent relays are used for backup protection generally, and both relays have normally this problem, the maloperation, caused by a fault in the overlapped protection area. Corresponding to an IEEE standard, this problem can be solved with the modification of the operating time. On the other hand, in Korea, zones are modified to cope with this problem in some specific conditions. These two methods may not be obvious to handle this problem correctly because these methods, modifying the common rules, can cause another coordination problem. To overcome asynchronizing protection, this paper describes an improved backup protection coordination scheme using a new logic that will be suggested.

Interference Aware Downlink Channel Allocation Algorithm to Improve Throughput on OFDMA Cellular Multihop Networks with Random Topology (임의의 토폴로지를 갖는 OFDMA 다중홉 셀룰러 네트워크의 하향링크 간섭 완화를 위한 채널 할당 방법)

  • Lim, Sunggook;Lee, Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.1
    • /
    • pp.43-51
    • /
    • 2015
  • Upcoming cellular networks such as LTE-advanced and IEEE 802.16m are enhanced by relay stations to support high data rate multimedia services and minimize the shadow zone with low cost. Enhancing the relay stations, however, divides the multihop cellular network into smaller microcells and the distance between microcells is closer, which intends large intra-cell and inter-cell interference. Especially the access link on downlink in the OFDMA cellular network is the throughput bottleneck due to the severe interference caused by base stations and relay stations transmitting large data to mobile stations simultaneously. In this paper, we present interference aware channel allocation algorithm to avoid severe interference on multihop cellular networks with random topology. Proposed algorithm increases SINR(signal to interference plus noise ratio) and decreases number of required control messages for channel allocation, so that increases overall throughput on the networks.

A QoS-aware Adaptive Coloring Scheduling Algorithm for Co-located WBANs

  • Wang, Jingxian;Sun, Yongmei;Luo, Shuyun;Ji, Yuefeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5800-5818
    • /
    • 2018
  • Interference may occur when several co-located wireless body area networks (WBANs) share the same channel simultaneously, which is compressed by resource scheduling generally. In this paper, a QoS-aware Adaptive Coloring (QAC) scheduling algorithm is proposed, which contains two components: interference sets determination and time slots assignment. The highlight of QAC is to determine the interference graph based on the relay scheme and adapted to the network QoS by multi-coloring approach. However, the frequent resource assignment brings in extra energy consumption and packet loss. Thus we come up with a launch condition for the QAC scheduling algorithm, that is if the interference duration is longer than a threshold predetermined, time slots rescheduling is activated. Furthermore, based on the relative distance and moving speed between WBANs, a prediction model for interference duration is proposed. The simulation results show that compared with the state-of-the-art approaches, the QAC scheduling algorithm has better performance in terms of network capacity, average delay and resource utility.

Clustering Algorithm Considering Sensor Node Distribution in Wireless Sensor Networks

  • Yu, Boseon;Choi, Wonik;Lee, Taikjin;Kim, Hyunduk
    • Journal of Information Processing Systems
    • /
    • v.14 no.4
    • /
    • pp.926-940
    • /
    • 2018
  • In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

Design and Implementation of Standby Power Control Module based on Low Power Active RFID (저 전력 능동형 RFID 기반 대기 전력 제어 모듈 설계 및 구현)

  • Jang, Ji-Woong;Lee, Kyung-Hoon;Kim, Young-Min
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.4
    • /
    • pp.491-497
    • /
    • 2015
  • In this paper a method of design and Implementation of RFID based control system for reducing standby power consumption at the power outlet is described. The system is composed of a RF controlled power outlet having relay and an active RFID tag communicating with the RF reader module controlling the relay. When the tag carried by human approaches to the RF reader the reader recognizes the tag and switch off the relay based on the RSSI level measurement. A low power packet prediction algorithm has been used to decrease the DC power consumption at both the tag and the RF reader. The result of experiment shows that successful operation of the relay control has been obtained while low power operation of the tag and the reader is achieved using above algorithm. Also setting the distance between the reader and the tag by controlling transmission power of the tag and adjusting the duty cycle of the packet waiting time when the reader is in idle state allows us to reduce DC power consumption at both the reader and the tag.

Pre-cluster HEAD Selection Scheme based on Node Distance in Chain-Based Protocol (체인기반 프로토콜에서 노드의 거리에 따른 예비 헤드노드 선출 방법)

  • Kim, Hyun-Duk;Choi, Won-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1273-1287
    • /
    • 2009
  • PEGASIS, a chain-based protocol, forms chains from sensor nodes so that each node transmits and receives from a neighbor. In this way, only one node (known as a HEAD) is selected from that chain to transmit to the sink. Although PEGASIS is able to balance the workload among all of the nodes by selecting the HEAD node in turn, a considerable amount of energy may be wasted when nodes which are far away from sink node act as the HEAD. In this study, DERP (Distance-based Energy-efficient Routing Protocol) is proposed to address this problem. DERP is a chain-based protocol that improves the greedy-algorithm in PEGASIS by taking into account the distance from the HEAD to the sink node. The main idea of DERP is to adopt a pre-HEAD (P-HD) to distribute the energy load evenly among sensor nodes. In addition, to scale DERP to a large network, it can be extended to a multi-hop clustering protocol by selecting a "relay node" according to the distance between the P-HD and SINK. Analysis and simulation studies of DERP show that it consumes up to 80% less energy, and has less of a transmission delay compared to PEGASIS.

  • PDF

A Directional Relay Algorithm Using Positive-Sequence Superimposed Quantity for Transmission Line Protection (정상 성분 변화량을 이용한 송전선로 보호용 방향 계전 알고리즘)

  • 이명수;유석구
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.4
    • /
    • pp.226-233
    • /
    • 2003
  • Directional elements are fundamental to protection scheme security and selectivity, performing such critical tasks as supervising distance elements and controlling overcurrent elements. But, conventional operating principles for directional detection based on negative or zero sequence quantify do not satisfy the requirements for improved sensitivity and fast operation under any fault conditions. In this paper, new algorithm for directional elements is proposed. The proposed algorithm use the positive-sequence superimposed voltages and currents in order to be used in all fault conditions. Also, because this algorithm uses a voltage compensation method. it can be well operated under strong source conditions.