• Title/Summary/Keyword: relay location

Search Result 111, Processing Time 0.023 seconds

The Study of FACTS Impacts for Probabilistic Transient Stability

  • Kim Hyung-Chul;Kwon Sae-Hyuk
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.2
    • /
    • pp.129-136
    • /
    • 2006
  • This paper proposes a probabilistic evaluation for the transient stability of electrical power systems incorporating FACTS devices. The uncertainties of the fault location and relay operation time play important keys in power system instability evaluation. The TCSC and SVC are employed for the reduction of system instability probability. This method is demonstrated by the WSCC test system and the results are compared with and without FACTS by means of Monte Carlo simulation.

A Position Recognition Method of Mobile Relay with Acceleration Sensor for Efficient Communication Network Connection (효율적인 통신망 연결을 위한 가속도 센서를 탑재한 이동식 중계기의 위치 인식 방안)

  • Hong, Sung-Hwa
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.527-528
    • /
    • 2022
  • It is not easy to identify the location of mobile terminals based on drones in the mountainous area, the densely populated urban area, or the space where mobile terminals can easily move by using equipments or modules that can recognize the location of sensors or mobile terminals with LBS (Location-Based Service). However, although the performance of GPS has developed due to the development of technology, it is still widely used in position recognition systems using GPS modules in the sea and onshore, and there is much room for more utilization. Currently, most of the existing sensor networks need to send at least three location information messages to mobile terminals with location information that a plurality of mobile base stations depend on GPS. However, location recognition of mobile repeaters that maintain a certain movement speed using acceleration sensors is necessary for efficient communication network connection.

  • PDF

Fault location identification and protective coordination schemes presentation of distribution system interconnected Distributed Generation (분산전원이 연계된 배전계통의 사고지점 확인 및 보호협조 방안 제시)

  • Choi, Dong-Man;Choi, Joon-Ho;Ro, Kyoung-Soo;Moon, Seung-Il;Kim, Jae-Chul
    • Proceedings of the KIEE Conference
    • /
    • 2005.11b
    • /
    • pp.313-315
    • /
    • 2005
  • Recently There has been growing interest in new renewable energy systems with high-energy efficiency due to the increasing energy consumption and environmental pollution problems. But an insertion of new distributed generation to existng power distribution systems can cause several problems such as voltage variations, harmonics, protective coordination, increasing fault current etc, because of reverse power. This paper was applied to fault location defecting a method as each Relay sensing fault current value and carried out short-circuit analysis by MATLAB and PSCAD/EMTDC programs and identity the faulted section o f22.9[kV] distribution system interconnected a large number of distributed generation. The existing protection system of 22.9[kV] power distribution system analyzed and the study on protective coordination recloser and Sectionalzer accomplished

  • PDF

The Fault Location Estimation Algorithm in Transmission Line Using a Recursive Least Square Error Method (순환형 최소자승법을 이용한 송전선로의 고장점 추정 알고리즘)

  • Yoon, C.D.;Lee, J.J.;Jung, H.S.;Shin, M.C.;Choi, S.Y.
    • Proceedings of the KIEE Conference
    • /
    • 2002.07a
    • /
    • pp.203-205
    • /
    • 2002
  • This paper presents the fault location estimation algorithm in transmission line using a recursive least square error method (RLSE). To minimize the computational burden of the digital relay a RLSE approach is used. Computer simulation results of the RLSE algorithm seem promising, indicating that it should be considered for further testing and evaluation.

  • PDF

Routing for Enhancing Source-Location Privacy in Wireless Sensor Networks of Multiple Assets

  • Tscha, Yeong-Hwan
    • Journal of Communications and Networks
    • /
    • v.11 no.6
    • /
    • pp.589-598
    • /
    • 2009
  • In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

Optimization Routing Protocol based on the Location, and Distance information of Sensor Nodes (센서 노드의 위치와 거리 정보를 기반으로 전송 경로를 최적화하는 라우팅 프로토콜)

  • Kim, Yong-Tae;Jeong, Yoon-Su
    • Journal of Digital Convergence
    • /
    • v.13 no.2
    • /
    • pp.127-133
    • /
    • 2015
  • In order for location information to deliver the collected information, it needs Sensor Nodes in an environment of Sensor Network. Each sensor sends data to a base station through the process of routing in a wireless sensor network environment. Therefore, Offering accurate location information is very important in a wireless sensor network environment. Most of existed routing methods save all the informations of nodes at the area of 1-hop. In order to save these informations, unnecessary wasted energy and traffics are generated. Routing Protocol proposed in this paper doesn't save node's location information, and doesn't exchange any periodic location information to reduce wasted energy. It includes transmission range of source nodes and nodes with the location information, however it doesn't include any nodes' routing near 1-hope distance.

A Fault Detection and Location Algorithm Using a Time Constant for DC Railway Systems (시정수를 이용한 직류철도급전계통에서의 고장판단 및 고장점표정 알고리즘)

  • 양언필;강상희;권영진
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.10
    • /
    • pp.563-570
    • /
    • 2003
  • When a fault occurs on railway feeders it is very important to detect the fault to protect trains and facilities. Because a DC railway system has low feeder voltage, The fault current can be smaller than the current of load starting. So it is important to discriminate between the small fault current and the load starting current. The load starting current increases step by step but the fault current increases at one time. So the type of $\Delta$I/ relay(50F) was developed using the different characteristics between the load starting current and the fault current. The load starting current increases step by step so the time constant of each step is much smaller than that of the fault current. First, to detect faults in DC railway systems, an algorithm using the time constant calculated by the method of least squares is presented in this paper. If a fault occurs on DC railway systems it is necessary to find a fault location to repair the faulted system as soon as possible. The second aim of the paper is to calculate the accurate fault location using Kirchhoff's voltage law.

Cooperative Communication Transmission Scheme using Partially Differential Modulation (부분차등변조 방식을 이용한 협력통신 전송기법)

  • Cho, Woong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.7
    • /
    • pp.805-810
    • /
    • 2014
  • Cooperative communication, which transmit signal via arbitrary number of relays, enhances the overall communication performance by providing virtual Multi-Input Multi-Output (MIMO) gain without imposing multiple antennal limitation in physical system. There are two representative relaying protocols, i.e., Amplify-and-Forward (AF) and Decode-and-Forward (DF), where we analyze the performance of cooperative communication by adopting DF relaying protocol applying partially differential modulation. The performance is based on symbol error rate (SER), and the effect of relay location on the performance is analyzed. We also compare the performance of the proposed scheme with the system which uses differential modulation scheme.

A Pilot-Tone Based Channel Estimation Technique for Cooperative SFBC-OFDM Systems (Cooperative SFBC-OFDM 시스템을 위한 파일럿 톤 기반의 채널 추정 기법)

  • Park, Chang-Hwan;Ko, Yo-Han;Lee, Hee-Soo;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9C
    • /
    • pp.661-668
    • /
    • 2008
  • In this paper, a channel estimation technique based on pilot tones is proposed for cooperative SFBC-OFDM systems with a STO(Symbol Timing Offset). In a cooperative SFBC-OFDM system, the STO between RS(Relay Station) and MS(Mobile Station) varies depending on the location of MS. Since the STO causes distortion in the form of phase rotation, a channel estimation technique based on linear interpolation with respect to phase and amplitude is proposed for the case of orthogonal pilot allocation. Also, a channel estimation technique is proposed by solving nonlinear equation for the case of pilot structure with orthogonal code. It is shown by computer simulation that the performance of channel estimation can be significantly improved when the proposed techniques are applied to cooperative SFBC-OFDM systems with STO.

A Storage and Computation Efficient RFID Distance Bounding Protocol (저장 공간 및 연산 효율적인 RFID 경계 결정 프로토콜)

  • Ahn, Hae-Soon;Yoon, Eun-Jun;Bu, Ki-Dong;Nam, In-Gil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1350-1359
    • /
    • 2010
  • Recently many researchers have been proved that general RFID system for proximity authentication is vulnerable to various location-based relay attacks such as distance fraud, mafia fraud and terrorist fraud attacks. The distance-bounding protocol is used to prevent the relay attacks by measuring the round trip time of single challenge-response bit. In 2008, Munilla and Peinado proposed an improved distance-bounding protocol applying void-challenge technique based on Hancke-Kuhn's protocol. Compare with Hancke-Kuhn's protocol, Munilla and Peinado's protocol is more secure because the success probability of an adversary has (5/8)n. However, Munilla and Peinado's protocol is inefficient for low-cost passive RFID tags because it requires large storage space and many hash function computations. Thus, this paper proposes a new RFID distance-bounding protocol for low-cost passive RFID tags that can be reduced the storage space and hash function computations. As a result, the proposed distance-bounding protocol not only can provide both storage space efficiency and computational efficiency, but also can provide strong security against the relay attacks because the adversary's success probability can be reduced by $(5/8)^n$.