• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.12
• /
• pp.2167-2172
• /
• 2008

A large scale embedded generator or a micro-grid is usually interconnected to the grid through the dedicated line. Immediately after the removal of the grid supply, it must be disconnected and remain disconnected until the normal grid supplies are restored. This paper proposes an islanding detection algorithm based on complex power at the intertie. Complex power at the intertie delivered to the grid has a value depending on power flow during normal operation. When loss of mains occurs, complex power at the intertie moves to a value depending on the parameters of the dedicated line. The performance of the proposed algorithm was investigated under various operating and fault conditions. The proposed algorithm can detect an islanding operation even if no power is exchanged prior to loss of mains and discriminate the fault condition from islanding.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.55 no.5
• /
• pp.280-286
• /
• 2006

The paper proposes a new protection algorithm for reliable operation of grid-interfaced PV system, which can flexibly interact with conventional protective schemes of power utility grid not only to prevent damages to utility or public persons and utility apparatus caused by malfunction or failure in distribution network protection system, but also to protect a PV system itself from faults or abnormal conditions of the network. The proposed algorithm is based on reclosing characteristics of the distribution system. As a network fault occurs, the new scheme determines whether it is momentary or permanent and responds in a pre-programmed way to the fault. For permanent outage, the proposed algorithm shuts down inverter's operations but monitoring system voltage and frequency at the point of common coupling with grid. When it comes to the momentary outage, Inverter starts stand-by operation mode so that it can be automatically connected to the grid without start-up procedures as soon as the system voltage and frequency returns into the normal operation range. In order to investigate' and evaluate the PV system operation, simulation study based on PSCAD/EMTDC has been carried out to verify the performance of the proposed protection scheme.

• Journal of Power Electronics
• /
• v.19 no.5
• /
• pp.1248-1258
• /
• 2019

This paper presents a moth-flame optimization (MFO)-based maximum power point tracking (MPPT) method for photovoltaic (PV) systems. The MFO algorithm is a new optimization method that exhibits satisfactory performance in terms of exploration, exploitation, local optima avoidance, and convergence. Therefore, the MFO algorithm is quite suitable for solving multiple peaks of PV systems under partial shading conditions (PSCs). The proposed MFO-MPPT is compared with four MPPT algorithms, namely the perturb and observe (P&O)-MPPT, incremental conductance (INC)-MPPT, particle swarm optimization (PSO)-MPPT and whale optimization algorithm (WOA)-MPPT. Simulation and experiment results demonstrate that the proposed algorithm can extract the global maximum power point (MPP) with greater tracking speed and accuracy under various conditions.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.3
• /
• pp.117-124
• /
• 2023

In the machine vision inspection equipment, diameter measurement is important process in inspection of cylindrical object. However, machine vision inspection equipment requires complex algorithm processing such as camera distortion correction and perspective distortion correction, and the increase in processing time and cost required for precise diameter measurement. In this paper, we proposed the algorithm for diameter measurement of cylindrical object using the laser displacement sensor. In order to fit circle for given four input outer points, grid search algorithms using root-mean-square error and mean-absolute error are applied and compared. To solve the limitations of the grid search algorithm, we finally apply the singular-value-decomposition based circle fitting algorithm. In order to compare the performance of the algorithms, we generated the pseudo data of the outer points of the cylindrical object and applied each algorithm. As a result of the experiment, the grid search using root-mean-square error confirmed stable measurement results, but it was confirmed that real-time processing was difficult as the execution time was 10.8059 second. The execution time of mean-absolute error algorithm was greatly improved as 0.3639 second, but there was no weight according to the distance, so the result of algorithm is abnormal. On the other hand, the singular-value-decomposition method was not affected by the grid and could not only obtain precise detection results, but also confirmed a very good execution time of 0.6 millisecond.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.6
• /
• pp.1053-1058
• /
• 2010

A large modern wind farm should satisfy the requirements for a grid and accomplish the optimization of the wind farm system. The wind farm intertie protection system should consider a Fault Ride-Through (FRT) requirement for more reliable protection. The wind farm should keep connected to the grid in the case of a grid fault whilst it should be isolated for an intertie fault. This paper proposes a distance relaying algorithm suitable for wind farm intertie protection considering the FRT requirement. The proposed algorithm estimates the impedance based on a differential equation method because the frequency of the voltage and current deviates the nominal frequency. The algorithm extends the reach of Zone 1 up to 100 % of the length of the intertie to implement the FRT requirement. To discriminate an intertie fault from a grid fault, the algorithm uses a voltage blocking scheme because the magnitude of the voltage at the relaying point for an intertie fault becomes less than that for a grid fault. The performance of the algorithm is verified using a PSCAD/EMTDC simulator under various fault conditions. The algorithm can discriminate successfully the intertie fault from grid fault and thus helps to implement the FRT requirement of a wind farm.

• Journal of Power Electronics
• /
• v.16 no.1
• /
• pp.18-26
• /
• 2016

This paper proposes a compensation algorithm for reducing a specific ripple component on synchronous reference frame phase locked loop (SRF-PLL) in grid-tied single-phase inverters. In general, SRF-PLL, which is based on all-pass filter to generate virtual voltage, is widely used to estimate the grid phase angle in a single-phase system. In reality, the estimated grid phase angle might be distorted because the phase difference between actual and virtual voltages is not 90 degrees. That is, the phase error is caused by the difference between cut-off frequency of all-pass filter and grid frequency under grid frequency variation. Therefore, the effects on phase angle and output current attributed to the phase error are mathematically analyzed in this paper. In addition, the proportional resonant (PR) controller is adapted to reduce the effects of phase error. The validity of the proposed algorithm is verified through several simulations and experiments.

• Journal of Korea Multimedia Society
• /
• v.22 no.8
• /
• pp.913-922
• /
• 2019

The Internet of Things (IoT) envisions smart objects collecting and sharing data at a massive scale via the Internet. One challenging issue is how to disseminate data to relevant data consuming objects efficiently. In such a massive IoT network, Mission critical data dissemination imposes constraints on the message transfer delay between objects. Due to the low power and communication range of IoT objects, data is relayed over multi-hops before arriving at the destination. In this paper, we propose a quorum-based adaptive dissemination algorithm (QADA) for the critical data in the monitoring-based applications of massive IoTs. To design QADA, we first design a new stepped-triangular grid structures (sT-grid) that support data dissemination, then construct a triangular grid overlay in the fog layer on the lower IoT layer and propose the data dissemination algorithm of the publish/subscribe model that adaptively uses triangle grid (T-grid) and sT-grid quorums depending on the mission critical in the overlay constructed to disseminate the critical data, and evaluate its performance as an analytical model.

• Journal of Information Processing Systems
• /
• v.6 no.1
• /
• pp.67-78
• /
• 2010

In this study, a clustering algorithm that uses DCT transformed data is presented. The algorithm is a grid density-based clustering algorithm that can identify clusters of arbitrary shape. Streaming data are transformed and reconstructed as needed for clustering. Experimental results show that DCT is able to approximate a data distribution efficiently using only a small number of coefficients and preserve the clusters well. The grid based clustering algorithm works well with DCT transformed data, demonstrating the viability of DCT for data stream clustering applications.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.8
• /
• pp.1-7
• /
• 2005

This paper proposes a local improvement method that combines extended topological clean up and optimization-based smoothing for homogenizing triangular grid system. First extended topological clean up procedures are applied to improve the connectivities of grid elements. Then, local optimization-based smoothing is performed for maximizing the distortion metric that measures grid quality. Using the local improvement strategy, we implement the grid homogenizations for two triangular grid examples. It is shown that the suggested algorithm improves the quality of the triangular grids to a great degree in an efficient manner and also can be easily applied to the remeshing algorithm in adaptive mesh refinement technique.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.525-534
• /
• 2005

This paper is concerned with the query slipping and its prevention for trajectory-based matchmaking service in wireless sensor networks. The problem happens when a query propagating along a subscribe trajectory moves through a publish trajectory without obtaining desired information, even though two trajectories intersect geometrically. There follows resubmission of the query or initiation of another subscribe trajectory Thus, query slipping results in considerable time delay and in the worst, looping in the trajectory or query flooding the network. We address the problem formally and suggest a solution. First, the area where nodes are distributed is logically partitioned into smaller grids, and a grid-based multicast next-hop selection algorithm is proposed. Our algorithm not only attempts to make the trajectory straight but also considers the nodal density of recipient nodes and the seamless grid-by-grid multicast. We prove that the publishing and subscribing using the algorithm eventually eliminate the possibility of the slipping. It toms out that our algorithm dissipates significantly less power of neighbor nodes, compared to the non grid-based method, as greedy forwarding, and the fixed- sized grid approach, as GAF (Geographical Adaptive Fidelity)