• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.268-269
• /
• 2006

Auto-synchonizer is important device to match the voltage, frequency, phase of the generating system to those factors of the transmission line, when the synchronous generator is operated. There were few or no incidents by Synchronization failure at Hapcheon hydraulic power plant, since it was built in 1989. but incidents by Synchronization failure have often happend lately. From now, let's improve the efficiency on the maintenance of generating equipment by studying about the cause and the method for this problem by comparing with the set point of each device of synchronizing system.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.1
• /
• pp.163-170
• /
• 2010

Multiple subsystems are required to behave synchronously or cooperatively in many areas. For example, synchronous behaviors are common in networks of (electro-) mechanical systems, cell biology, coupled neurons, and cooperating robots. This paper presents a feedback scheme for synchronization between Hindmarsh-Rose models which have polynomial vector fields. We show that the problem is equivalent to finding an asymptotically stabilizing control for error dynamics which is also a polynomial system. Then, an extension to a nonlinear observer-based scheme is presented, which reduces the amount of information exchange between models.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.72-79
• /
• 2011

The importance of parallel programming seriously emerges ever since the modern microprocessor architecture has been shifted to the multi-core system. Transactional Memory has been proposed to address synchronization which is usually implemented by using locks. However, the lock based synchronization method reduces the parallelism and has the possibility of causing deadlock. In this paper, we propose an efficient method to utilize transactional memory for the situation which has high contention. The proposed idea is based on the theoretical analysis and it is verified with simulation results. The simulation environment has been implemented using HTM(Hardware Transactional Memory) systems. We also propose a model of the dining philosopher problem to discuss the efficient resource management using the transactional memory technique.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.1011-1016
• /
• 2018

Ubiquitous services for the convenience and safety of human beings along with the development of society are being realized through RFID technology and sensor network, and its application range of fields is also broaden. However, since the USN contains all the information of individuals and things, all of its private spaces can be attacked by external attacks; so, that the problem of security continues to arise. We designed a one-way chaotic feedback synchronization method as a secure communication method to fit the USN composed of one sync node and n number of sensor nodes. We designed the method by which the sensor node is synchronized in one direction of the sync node. This method solves the problem that all sensor nodes need to be resynchronized when the sync node is changed, which is shown in bidirectional synchronization. This is a security method that can be effectively applied to 1:n communication such as USN.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.135-138
• /
• 2008

The existing protocol which processes sequentially synchronization has the problem where synchronization tasks which are requested subsequently from multiple client. Should be waited for a long time. In this paper, we propose a implementation of concurrent synchronization protocol that is capable of reducing the waiting time. If there are no update conflicts among different synchronization tasks, the proposed protocol synchronizes using the multi-queue based on the round-robin scheme, in order to reduce the waiting time.

• Journal of Korea Game Society
• /
• v.5 no.4
• /
• pp.33-38
• /
• 2005

In the online game that thousands of participants connect to a game world by using Internet simultaneously, participants of the game world may have different hardwares and network environments, and messages of participants should be synchronization. A solution for the synchronization problem is to wait for a certain amount of time until the server processes the message. It is not easy to determine a suitable waiting period because of the trade-off between the fairness and the responsiveness. In this paper we propose a method to decide a waiting period by considering features of the MMOFPS game and the probability of interaction among participants. We implement the proposed method and perform experiments for the performance evaluation.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1998.06a
• /
• pp.515-520
• /
• 1998

In this paper, we propose a new fault tolerant architecture for high availability systems, where for module internal operations both processor modules perform the same tasks at the same time independently of each other while for module external operations both processor modules act actively. That is, operations of synchronization between dual processor modules except clock synchronization are requested only when module external operations are executed. The architecture can not only improve system availability by reducing system reintegration time but also reduce performance degradation problem due to frequent synchronization between dual processor modules. The clock unit consists of a clock generator and a clock synchronization circuit. This supplies a stable clock signal under clock unit disorder of any processor module or rapid clock signal variation. And this architecture achieves system availability and data credibility by designing as symmetrical form.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.419-421
• /
• 2010

Mobile client-Server synchronization system supporting for field updating of spatio-temporal data could be interrupted incompletely as it has some failure of client-server system and network during synchronizing work. Thus the interruption of synchronizing could make some problem with not progressing normal synchronizing work while re-performing for the consistent error of client-server system and synchronization. This study analyzes defects that are generated at the mobile client-server environment and proposes recovery techniques which can rerun consistence of DB and synchronization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.588-591
• /
• 2009

In ubiquitous computing GIS services, it is possible to use the spatio-temporal data anytime through the mobile device. GIS services regularly update use the latest spatio-temporal data to provide the most suitable services. For this situation, update data is distributed to CD or wired networks update services. However, this method has problem to propagate update data to users as taking long time. In this paper, suggests a synchronization system which propagate update data to users for reducing processing time efficiently. This synchronization system collects update data in the field and synchronizes server with collected data to use mobile devices by real time. For this system, I design and materialize synchronization module which updates update data and wireless network module.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.11
• /
• pp.1022-1032
• /
• 2012

In OFDMA-based wireless mesh networks, synchronization of carrier frequencies among adjacent nodes is known to be difficult. In this paper, a distributed synchronization technique is proposed to solve the synchronization problem in OFDMA-based wireless mesh networks by using the bio-inspired algorithm. In the proposed approach, carrier frequencies of all nodes in a mesh network are converged into one frequency by locally synchronizing the frequencies of adjacent nodes. It may take a long time to be converged in some topologies since the convergence characteristic of carrier frequencies in a mesh network may vary depending on the size of the network and deployment of nodes. It is shown that fast frequency synchronization, not heavily depending on the topology, can be achieved through the proposed algorithm with an adjustable weight.