• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.23-28
• /
• 2015

TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol for WSN(wireless sensor networks), was developed to provide higher synchronization accuracy and energy efficiency. So, TPSN's approach has been referenced by so many other WSN synchronization schemes till now. However, TPSN has a collision problem due to simultaneous transmission among competing nodes, which causes more network convergence delay for a network-wide synchronization. A Polling-based scheme for TPSN is proposed in this paper. The proposed scheme not only shortens network-wide synchronization time of TPSN, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.

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

The time information of sptio-temporal data in synchronization system of a mobile environment can be applied according to time data of various kinds. However, that previous data is synchronized related with progress of synchronization operation is a problem when saving the time data of sptio-temporal data depends on the registration time. In this paper, classifies the time used as time data for synchronization data, defines time data model suitable for synchronization of sptio-temporal data and suggests a synchronization system which uses time data model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5446-5463
• /
• 2019

Parallel computing system components should be harmonized, and this harmonization is kept existent using synchronization time. Synchronization time affects the system in two ways. First, if we have too little synchronization time, some tasks face the problem of harmonization, as they need appropriate time to update and synchronize with the system. Second, if we allocate a large amount of time, stall system created. Random allocation of synchronization time for parallel systems slows down not only the booting time of the system but also the execution time of each application involved in the system. This paper presents a simulator used to test and allocate appropriate synchronization time for distributed and parallel heterogeneous systems. The simulator creates the parallel and heterogeneous system to be evaluated, and lets the user vary the synchronization time to optimize the booting time. NS3-cGEM5 simulator in this paper is formed by HLA-RTI federation integration of the two independent architecture and network simulators - NS3 and cGEM5. Therefore, nodes created on these simulators need synchronizations for harmonized system performance. We tested and allocated the appropriate synchronization time for our sample parallel system composed of one x86 server and three ARM clients.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.279-286
• /
• 2005

As the mobile environment has been generalized, data synchronization with mobile devices or mobile device and PC/server is required. To deal with the problem, the consortium was established by the companies, such as Motorola, Ericsson, and Nokia, and released SyncML(Synchronization Markup Language) as a standard of industrial area for interoperating with data synchronization and various transmission protocol. But, in synchronization process, when more than two clients requested data synchronization, data conflict can be happened. This paper studies the various conflict reasons that can happen in data synchronization processes and groups them systematically Through the analyzed information, we compose the Change Log Information(CLI) that can keep track of the chased information about synchronization. And we suggest an operation policy using CLI. Finally, we design an algorithm and adapt the policy as a method for the safety and consistency of data.

• Journal of Korea Multimedia Society
• /
• v.19 no.10
• /
• pp.1808-1815
• /
• 2016

TPSN(Timing-sync Protocol for Sensor Networks), the representative of time synchronization protocol, has been already developed to provide time synchronization among nodes in wireless sensor networks. Even though the TPSN's method has been referenced by so many other time synchronization schemes for resource-constrained networks like wireless sensor networks or low power personal area networks, it has some inefficiency in terms of power consumption and network-wide synchronization time (or called convergence time). The main reason is that each node in TPSN needs waiting delay to solve the collision problem due to simultaneous transmission among competing nodes, which causes more power consumption and longer network convergence time for a network-wide synchronization. In this paper an improved scheme is proposed by changing message exchange method among nodes. The proposed scheme not only shortens network-wide synchronization time, but also reduce collision traffic which lead to needless power consumption. The proposed scheme's performance has been evaluated and compared with an original scheme by simulation. The results are shown to be better than the original algorithm used in TPSN.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1144-1149
• /
• 2009

This paper deals with the time synchronization problem over SpaceWire links. SpaceWire is a standard for high-speed links and networks between spacecraft components, which was invented for better, cheaper, faster on-board data handling in spacecraft. The standard defines Time-Code for time distribution over SpaceWire network. When a Time-Code is transmitted, transmission delay and jitter is unavoidable. In this paper, a mechanism to remove Time-Code transmission delay and jitter over SpaceWire links is proposed and implemented with FPGA for validation. The proposed mechanism achieves high resolution clock synchronization over SpaceWire links, complies with the standard and can be easily adopted over SpaceWire network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.649-655
• /
• 2005

We propose a robust channel estimation method against imperfect synchronization in orthogonal frequency division multiple access (OFDMA) downlink systems. We address time and frequency synchronization, and the channel estimation at the same time, and try to minimize the error propagation from the time and frequency synchronization steps into the chailnel estimation. The simulation results show that the proposed channel estimation method outperforms the conventional algorithms by about 3dB, and circumvents the problem of mismatch among the synchronization tasks.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.18-25
• /
• 1998

The basic requirements of distributed multimedia systems are intramedia synchronization which asks the strict delay and jitter for the check period of media buffer and the scaling duration with periodic continuous media such as audio and video media, and intermedia synchronization that needs the constraint for relative time relations among them when several media are presented in parallel. In this paper, a distributed intermedia synchronization algorithm that solves the intermedia synchronization problem by using variable service rates based on the fuzzy logic is designed and then the performance is evaluated through simulation.

• Proceedings of the Korea Database Society Conference
• /
• 2008.05a
• /
• pp.349-357
• /
• 2008

E-Catalogs are often duplicated in multiple database systems due to various reasons. This causes the problem of assuring ACID properties of global transactions in multi-database management systems. We suggest a log-based synchronization mechanism for a special situation that catalogs can be changed only in one system and the changes spread to other systems. We have defined several conditions that have to be satisfied to assure the synchronization of the information. We show that the information can be kept identical in a delayed manner if synchronization module fulfills the defined conditions. Finally we show that the suggested mechanism is useful by showing a real world application that uses this synchronization mechanism in e-commerce environment.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.6
• /
• pp.1043-1048
• /
• 2011

In this paper, a newsynchronization technique applied to burst-mode communication is proposed. A synchronization technique is to estimate carrier frequency and phase offsets in a noisy channel environment. A fundamental problem for estimating the parameters(carrier phase and frequency offsets) in burst-mode transmission is that the ways of pursuing estimation accuracy and transmission efficiency are always trade-off. To solve this problem, a new carrier recovery technique is proposed to improve the transmission efficiency with reliable performance especially at low S/N. In the proposed technique, the synchronization parameters are first estimated based on a data-aided feed-forward estimation scheme. Then, a phase tracker using decision-directed DPLL estimates the phase offset for the data portion of the burst data. From simulation results, it shows fast synchronization with shorter preamble maintaining reasonable BER performance at low S/N.