• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.382-385
• /
• 2011

The sensor network technology for core technology of ubiquitous computing is in the spotlight recently, the research on sensor network is proceeding actively which is composed many different sensor node. One of the important condition for design of sensor node is to extend for network life which is to minimize power-consumption under the limited resources of sensor network. This study suggest routing protocol that was used second level cluster structure to reduce power-consumption of sensor node. the first level use the previous routing protocol under the LEACH, second level decide to transmit or not by comparision of data value for Effective Usage, reduce the unnecessary power-consumption.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.10
• /
• pp.1598-1608
• /
• 1997

Based on the application of te theory of conjugate approximations and the Loubignac's iterative method in a local region, a method to improve the stress filed in a displacement-formulated finite element solution has been proposed. The validity of the proposed method has been tested through two examples : a thick cylinder under internal pressure loading and an infinite plate with a central circular hole subjected to uniaxial tension. As a result of analysis of the examples, it was found that the stress field obtained for the local region model by the proposed method approximates well for the whole domain model. In addition, it was found that because of a significant decrease in the computing time to obtain the improved stress field, the proposed method is efficient and useful for the detailed stress analysis in local regions.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.65-75
• /
• 2009

A Vehicular Ad-Hoc Network (VANET) is a form of Mobile ad-hoc network, to provide temporary communications among nearby vehicles. Mobile node of VANET consumes energy and resource with participating in the member of network. Some node tends to have a selfishness to place one's own profits above cooperation with others. As result of selfish node, it reduces data accessibility and the efficiency of networks. In this paper, we propose noble method, Friendship-VaR that excludes selfish nodes from a group of VANET. Friendship-VaR enables to improve data accessibility by eliminating selfish nodes and sharing data among reliable nodes. Friendship-VaR determines selfishness of nodes by simple data exchange. The experiments shows proposed method outperform existing method in terms of data accessibility.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.1
• /
• pp.5-14
• /
• 2002

This study presents a solution to control a Permanent Magnet Synchronous Motor without sensors based on the superposition principle. Because the proposed method of sensorless theory is very simple to compute the estimated angle, computing time to estimate the angle is shorter than other sensorless method. The use of this system yields enhanced operations, fewer system components, lower system cost, energy efficient control system design and increased efficiency. The performance of a sensorless architecture allows an intelligent approach to reduce the complete system costs of the digital motion control applications using cheaper electrical motors without sensors. This paper deals with an overview of sensorless solutions in PMSM control applications whereby the focus will be on the new controller without sensors and its applications.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1113-1128
• /
• 2020

Ad hoc networks play an important role in mobile communications, and the performance of nodes has a significant impact on the choice of communication links. To ensure efficient and secure data forwarding and delivery, an intelligent routing protocol (IAODV) based on learning method is constructed. Five attributes of node energy, rate, credit value, computing power and transmission distance are taken as the basis of segmentation. By learning the selected samples and calculating the information gain of each attribute, the decision tree of routing node is constructed, and the rules of routing node selection are determined. IAODV algorithm realizes the adaptive evaluation and classification of network nodes, so as to determine the optimal transmission path from the source node to the destination node. The simulation results verify the feasibility, effectiveness and security of IAODV.

• Bulletin of the Korean Chemical Society
• /
• v.34 no.4
• /
• pp.1043-1046
• /
• 2013

Prediction of physicochemical properties of organic molecules is an important process in chemistry and chemical engineering. The MSEP approach developed in our lab calculates the molecular surface electrostatic potential (ESP) on van der Waals (vdW) surfaces of molecules. This approach includes geometry optimization and frequency calculation using hybrid density functional theory, B3LYP, at the 6-31G(d) basis set to find minima on the potential energy surface, and is known to give satisfactory QSPR results for various properties of organic molecules. However, this MSEP method is not applicable to screen large database because geometry optimization and frequency calculation require considerable computing time. To develop a fast but yet reliable approach, we have re-examined our previous work on organic molecules using two semi-empirical methods, AM1 and PM3. This new approach can be an efficient protocol in designing new molecules with improved properties.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.115-125
• /
• 2015

This paper presents a Cuckoo search algorithm to secure adversaries misdirecting multi-hop routing in Mobile ad hoc networks (MANETs) using a robust Trust Predicated Routing Framework with an optimized cluster head selection. The clustering technique designed in this framework leads to efficient routing in MANETs. The heavy work load in the node causes an energy drop in cluster head, which leads to re-clustering of the group, and another cluster head is selected to avoid packet loss during data transmission. The problem in the re-clustering process is that the overall efficiency of the routing process is reduced and the processing time is increased. A Cuckoo search based optimization algorithm is proposed to solve the problem of re-clustering by selecting the secondary cluster head within the initially formed cluster group and eliminating the reclustering process. The proposed framework enables a node to select a reliable and secure route for MANET and the performance can be evaluated by comparing the simulated results with the AODV routing protocol, which shows that the performance of the proposed routing protocol are improved significantly.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.1010-1012
• /
• 2015

Interest in fossil fuels, alternative energy development in the world has increased significantly. That interest in solar systems increase significant and technology for efficiency and effective operation of PV technology, we expect to continue. This section provides the necessary information to users, and introduce the client system for mobile monitoring real-time solar system information, without the constraints of location or time, and leverage real-time information transmitted tell me about the expected effects that you can get to evaluate.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.346-350
• /
• 2010

Since sensor nodes have restriction of using resources in Zigbee network, number of study on improving efficiency is currently ongoing[1]. Clustering mechanism based on hierarchy structure provides a prevention of duplicated information and a facility of a network expansion[2]. however overheads can occurs when the cluster header is elected and the election of a incorrect cluster header causes to use resources inefficiently. In this paper, we propose that the cluster header election mechanism using distances between nodes and density of nodes in accordance with the operation of the central processing system in which the sync nodes are having information of location and energy with respect to general nodes based on hierachy clustering mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4648-4663
• /
• 2020

This paper proposes the Lempel-Ziv 4(LZ4) compression accelerator optimized for scale-out servers in data centers. In order to reduce CPU loads caused by compression, we propose an accelerator solution and implement the accelerator on an Field Programmable Gate Array(FPGA) as heterogeneous computing. The LZ4 compression hardware accelerator is a fully pipelined architecture and applies 16 dictionaries to enhance the parallelism for high throughput compressor. Our hardware accelerator is based on the 20-stage pipeline and dictionary architecture, highly customized to LZ4 compression algorithm and parallel hardware implementation. Proposing dictionary architecture allows achieving high throughput by comparing input sequences in multiple dictionaries simultaneously compared to a single dictionary. The experimental results provide the high throughput with intensively optimized in the FPGA. Additionally, we compare our implementation to CPU implementation results of LZ4 to provide insights on FPGA-based data centers. The proposed accelerator achieves the compression throughput of 639MB/s with fine parallelism to be deployed into scale-out servers. This approach enables the low power Intel Atom processor to realize the Hadoop storage along with the compression accelerator.