• Journal of Information Technology Services
• /
• v.8 no.2
• /
• pp.157-171
• /
• 2009

In mobile XML environments, the efficient synchronization technique is required to maintain the consistency of replicated XML data because the same data can be replicated between so many different XML documents. In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client XML documents and a server XML database in mobile XML environments. The proposed an XML data synchronization technique(XSA) has the advantage of model generality aspect and storage space aspect by using the tuple-based message digest table to detect the data conflicts. The proposed technique can be applicable to the application requiring the consistency of replicated XML data without any restrictions in the heterogeneous(between hierarchical XML documents and relational XML databases) mobile environments.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.1-12
• /
• 2006

In mobile database environments, the efficient synchronization technique is required to maintain the consistency of replicated data because the same data can be replicated between so many different databases, In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client databases and a server database in mobile environments. The proposed data synchronization technique has the advantage of generality aspect and extensibility aspect by using the tuple-based message digest output to detect the data conflicts.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.357-368
• /
• 2007

This paper proposes the SAMD(Synchronization Algorithms based on Message Digest) algorithm based on message digest in order to data synchronization between a database server and a mobile database. The SAMD algorithm makes the images at the database server and the mobile database using message digest tables and compares two images in order to select the rows needed to synchronization. If two images are different, the synchronization is progressed according to synchronization policy. The SAMD algorithm does not use techniques which are dependent the some database vendor and also triggers, stored procedures and timestamps. The SAMD only uses the standard SQL functions for the synchronization. Therefore the SAMD algorithm is used in any combinations of the database server and the mobile database because the SAMD algorithm is not depended on some database venders. Also the SAMD algorithm shows better performance compared with existing synchronization products.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.446-457
• /
• 2007

In wireless sensor network, to provide the proper responses quickly for diverse events, wireless sensor nodes have to cooperate with each other. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In the wireless sensor network, the message packets including time information are used for the time synchronization. However, the transmission of many message packets will exhaust the battery of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive transmission of message packets has an negative impact upon their lifetime. In this paper, the Reference Interpolation Protocol (RIP) is proposed to reduce the number of message packets for the time synchronization. The proposed method performs the time interpolation between the reference packet's time and the global time of the base station. The proposed method completes the synchronization operation with only 2 message packets when compared to the previous Reference Broadcast Synchronization (RBS) technique. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages and showed the 12.7 times less power consumption than the RBS method. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.272-274
• /
• 2005

In this paper, we analyses transmission performance of communication security(COMSEC) bit synchronization information over the single channel found and airborne radion system in variable message format system. Experimental results demonstrate the robust characteristics of the COMSEC bit synchronization information in $10^{-1}\sim10^{-5}$ of bit error channel and the relationship of time duration of bit synchronization and probability of synchronization detection.

• Journal of the Korea Society for Simulation
• /
• v.8 no.1
• /
• pp.77-88
• /
• 1999

There are two approaches to handle the Causality Error in parallel and distributed simulation. One approach is based on the conservative time synchronization and the other is the optimistic time synchronization. In this paper an efficient null message reduction method for the conservative time synchronization approach is suggested with the experimental results, which could improve performance of simulation and avoid deadlock situations.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.7
• /
• pp.443-446
• /
• 2005

In this paper, we analyses transmission performance of communication security(COMSEC) bit synchronization information over the single channel ground and airborne radion system in variable message format system. Experimental results demonstrate the robust characteristics of the COMSEC bit synchronization information in 10-1 $\~$ 10-5 of bit error channel and the relationship of time duration of bit synchronization and probability of synchronization detection.

• Journal of Korea Game Society
• /
• v.9 no.2
• /
• pp.105-113
• /
• 2009

The most important service of the online game is the stability. However, in online games, the increase in the number of users burdens the server as thousands of users connect to the server at the same time. While various techniques to reduce the load on the server are studied, the study is limited only to the server part like an improvement of server algorithms. In this paper, a program to handle the largest load of the server, the message synchronization of both the server and client, is designed and implemented.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.669-676
• /
• 2006

In this paper, we present a new framework and stream synchronization mechanism to effectively support developing real-time multimedia streaming services by using a real-time object model named TMO (Time-triggered Message-triggered Object). The purpose of the framework is twofold. Firstly, the framework helps developers to design complex distributed real-time multimedia streaming services. Secondly, it supports timely streaming facilities. In order to achieve these goals, our framework is consist of Multimedia Streaming TMO, MMStreaming TMO Support Library and TMO Support Middleware. The time-triggered spontaneous feature of the MMStream TMO and a global-time based synchronization scheme is used as a regulator against the irregular deliveries and processing of media units caused by QoS non-guaranteed systems and communication channels. In conclusion, timely service capability of our framework is expected to contributed to overall enhancement of the real-time multimedia streaming.

• Journal of Korea Multimedia Society
• /
• v.21 no.11
• /
• pp.1288-1296
• /
• 2018

PBS(Pairwise Broadcast Synchronization) is a well-known synchronization scheme for WSN(Wireless Sensor Networks). As PBS needs the set of node-pairs for network-wide synchronization by over-hearing, GPA(Group-Wise Pair Selection Algorithm) was also proposed after PBS. However, GPA is complex and requires too many message transmissions, leading to much power consumption. Besides, GPA is not appropriate to topology change or mobile wireless sensor networks. So, we propose a new and energy-efficient pair-node selection algorithm for PBS. The proposed scheme's performance has been evaluated and compared with GPA by simulation. The results are shown to be better than GPA.