• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.7
• /
• pp.1347-1353
• /
• 2011

While most of the existing protection schemes have been designed with local information around individual components, these local schemes are not considered capable of protecting the modern electric power gird with growing complexity. Recent blackouts in North America and Europe have renewed the emphasis on coordinated protection and control actions to avoid systemwide blackouts, utilizing all of the available grid information. Thus, this paper proposes a new methodology, Agent-based Colored Petri Net (ACPN) modeling for systematically representing, modeling and analyzing information flows and interactions among the entities of the electric power grid. The paper demonstrates its efficacy and accuracy by investigating an ACPN model of a wide area protection system for a typical power grid. The proposed modeling and analysis schemes may further provide a framework to help assure reliability and interoperability of diverse smart grid components.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.45 no.3
• /
• pp.226-232
• /
• 2017

Surface pressure distributions over the RAE-A wing-body configuration were investigated and the grid convergence along the streamwise, spanwise, and circumferential directions was numerically studied. Flow analysis in subsonic and transonic conditions was conducted using the $k-{\omega}$ Wilcox-Durbin+ turbulence model. Surface pressure distributions for subsonic flows were well matched, but those for transonic shocked flows showed a little discrepancy with the experimental data. A cubic spline extrapolation method was applied in order to investigate the grid convergence. This method presented that the grid resolution in the circumferential direction is the most important grid parameter. A refined grid system was made based on the grid convergence study and provided more accurate prediction, especially on the symmetric body surface of RAE-A configuration.

• Journal of the Society of Naval Architects of Korea
• /
• v.58 no.2
• /
• pp.90-96
• /
• 2021

In this study, the method of determining the state of grid points in the adaptable surface particle method based on grid system developed as a free-surface tracing method was improved. The adaptable surface particle method is a method of determining the state of the grid point according to the shape of the free-surface and obtaining the intersection of the given free-surface and grid line where the state of the grid point changes. It is difficult to determine the state of grid points in the event of rapid flow, such as collision or separation of free-surfaces, and this study suggests a method for determining the state of current grid points using the state of surrounding grid points where the state of grid point are known. A grid layer value was assigned sequentially to a grid away from the free-surface, centering on the boundary cell where the free-surface exists, to identify the connection information that the grid was separated from the free-surface, and to determine the state of the grid point sequentially from a grid away from the free-surface to a grid close to the free-surface. To verify the improved method, a numerical analysis was made on the problem of dam break in which a sudden collision of free-surface occurred and the results were compared, and the results were relatively reasonable.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.25-36
• /
• 2016

The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.3
• /
• pp.685-692
• /
• 2019

Smart grid enables efficient power management by allowing real-time awareness of electricity flows through two-way communication. Despite its various advantages, threats to user privacy caused by frequent meter reading hinder prosperous deployment of smart grid. In this paper, we propose a privacy-preserving aggregation method exploiting fully homomorphic encryption (FHE). Specifically, it achieves privacy-preserving fine-grained aggregation of electricity usage for smart grid customers in multiple electrical source environments, while further enhancing efficiency through SIMD-style operations simultaneously. Analysis of our scheme demonstrates the suitability in next-generation smart grid environment where the customers select and use a variety of power sources and systematic metering and control are enabled.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.137-141
• /
• 2005

Optimal path search algorithm should consider traffic flows of the roads as well as the distance between a departure and destination, The existing path search algorithms, however, usually don't apply the continuously changed traffic flows. In this paper, we propose a new optimal path search algorithm. the algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road networks into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and $A^*$ algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1510-1532
• /
• 2017

In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2221-2229
• /
• 2006

Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• International Journal of Aeronautical and Space Sciences
• /
• v.13 no.2
• /
• pp.188-198
• /
• 2012

An improvement to the k-${\varepsilon}$ turbulence model is presented and is shown to lead to better agreement with data regarding supersonic base flows. The improvement was achieved by imposing a grid-independent realizability constraint in the Launder-Sharma k-${\varepsilon}$ model. The effects of compressibility were also examined. The numerical results show that the modified Launder-Sharma model leads to some improvement in the prediction of the velocity and turbulent kinetic energy profiles. Compressibility corrections also lead to better agreement in both the turbulent kinetic energy and the Reynolds stress profiles with the experimental data.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.53 no.3
• /
• pp.286-292
• /
• 2017

The Coastal VTS will be continuously constructed to prevent marine traffic accidents in the coastal waters of the Republic of Korea. In order to provide the best traffic information service to the ship operator, it is important to understand the navigation risk factor. In this study, we analyzed the navigational hazards of Gunsan coastal area where the coastal VTS will be constructed until 2020. For this purpose, major traffic flows of merchant ships and density of vessels engaged in fishing were analyzed. This study was conducted by Automatic Identification System (AIS) and Vessel Pass (V-PASS) data. The grid intervals are 10 minute ${\times}$ 10 minute (latitude ${\times}$ longitude) based on the section of the sea. A total of 30 sections were analyzed by constructing a grid. As a result of the analysis, the major traffic flows of the merchant vessels in the coastal area of Gunsan were surveyed from north to south toward Incheon, Pyeongtaek, Daesan, Yeosu, Pusan and Ulsan, and from east to west in the port of Gunsan Port, 173-3, 173-6, 173-8, 183-2, 183-5, 183-8, 183-3, 184-1 and 184-2. As a result of the study, the fishing boats in Gunsan coastal area mainly operated in spring and autumn. On the other hand, the main traffic flow of merchant ships and the distribution of fishing vessels continue to overlap from March to June, so special attention should be paid to the control during this period.