• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.1697-1708
• /
• 2017

This paper proposes an algorithm for the differential protection of an Indirect Symmetrical Phase Shift Transformer (ISPST) by considering the different behaviors of the compensated differential current under internal fault and magnetizing inrush conditions. In this algorithm, a criterion function is defined which is based on the difference of amplitude of the wavelet transformation over a specific frequency band. The function has been used for the discrimination between three phase magnetizing inrush and internal fault condition and requires less than a quarter cycle after disturbance. This method is independent of any coefficient or threshold values of wavelet transformation. The merit of this algorithm is demonstrated by the simulation of different faults in series and excitation unit and magnetizing inrush with varying switching conditions on ISPST using PSCAD/EMTDC. Due to unavailability of in-field large interconnected transformers for such a large number of destructive tests, the results are further verified by Real Time Digital Simulator (RSCAD/RTDS). The proposed algorithm has been compared with the conventional harmonic restraint based method that justifies the application of wavelet transform for differential protection of ISPST. The proposed algorithm has also been verified for different rating of ISPSTs and satisfactory results were obtained.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.234-235
• /
• 2006

The protection relay keeps electric power facilities by using signals of the voltage and current which are input and output terminals of each equipment. Each relay performances protection algorithm by using informations of own protecting zone. To prevent the mal-operation in inrush current, established transformer differential protection method uses the second harmonics as blocking signal. This method is not operate at the initial inrush. However, in case of the parallel operation, if the initial inrush is occurred in one transformer which is generated, the sympathetic inrush Is occurred in adjacent transformer. This paper approach the sympathetic inrush detecting algorithm of a transformer based on agent. Proposed algorithm, when inrush current occurred, distinguish sympathetic inrush or not by using differential current of adjacent transformer. This algorithm have the advantage of the distinguishing initial inrush and sympathetic inrush at operation of parallel transformer

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.151-161
• /
• 2009

In Location-Based Services (LBSs), users requesting a location-based query send their exact location to a database server and thus the location information of the users can be misused by adversaries. Therefore, a privacy protection method is required for using LBS in a safe way. In this paper, we propose a new cloaking region generation algorithm using grids for privacy protection in LBSs. The proposed algorithm creates a m inimum cloaking region by finding L buildings and then performs K-anonymity to search K users. For this, we make use of not only a grid-based index structure, but also an efficient pruning techniques. Finally, we show from a performance analysis that our cloaking region generation algorithm outperforms the existing algorithm in term of the size of cloaking region.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.4
• /
• pp.552-558
• /
• 2009

We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.4
• /
• pp.460-467
• /
• 2008

This paper presents a new numerical algorithm for the fault location estimation and arcing fault detection when a single-phase arcing ground fault occurs on a transmission line. The proposed algorithm derived in the spectrum domain is based on the synchronized voltage and current samples measured from the PMUs(Phasor Measurement Units) installed at both ends of the transmission lines. In this paper, the algorithm uses DFT(Discrete Fourier Transform) for estimation. The algorithm uses a short data window for real-time transmission line protection. Also, from the calculated arc voltage amplitude, a decision can be made whether the fault is permanent or transient. The proposed algorithm is tested through computer simulation to show its effectiveness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.645-651
• /
• 2002

This thesis describes two wavelength allocation algorithms applied to OMS (Optical Multiplex Section) or OCh (Optical Channel) SPRING (Shared Protection Ring) and compares their characteristics by simulations. Two wavelength allocation algorithms are optimal algorithm and nonblocking algorithm applicable on SPRING WDM networks. In particular, when a node is added in previous ring network, how to work for each algorithm is considered. The optimal algorithm is better than nonblocking for most of comparisons. Nonblocking algorithm has an important advantage, though. Nonblocking algorithm has no wavelength connection or allocation to reconfigure some previous connections.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.9 no.5
• /
• pp.498-506
• /
• 2004

The protection algorithm of DC line grounding for the subway is proposed in this paper. Compared to the conventional protection algorithm, the proposed algorithm has a advantage that can distinguish the difference between service line and faulted line. The contents of the proposed algorithm are by using blocking filter and PLC(Power Line Carrier). Results of the simulation show that the proposed algorithm is very useful.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.517-520
• /
• 2006

In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm -multicast with SRLG sharing (MSS)- to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.524-526
• /
• 2007

In this letter, we study the multicast protection problem in sparse-splitting wavelength-division multiplexing (WDM) optical network, and propose a novel multicast protection algorithm called the shared source-leaf path-based protection (SLPP) algorithm. Unlike the proposals in previous studies, the backup paths derived by SLPP can share wavelength with the primary tree in sparse-splitting WDM networks. Simulations are used to evaluate the effectiveness of the SLPP algorithm.