• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.6
• /
• pp.1487-1495
• /
• 2013

Time synchronization is a prerequisite in wireless sensor network applications such as object tracking, consistent state update, duplication detection, and temporal order delivery. This paper analyze time synchronization accuracy of pair-wise time synchronization algorithm which is a typical time synchronization model of time synchronization method in wireless sensor networks. In addition, the analyzed results are verified by simulations. These results can be utilized for performance improvement or development of time synchronization in wireless sensor networks.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.15-22
• /
• 2011

Usually time synchronization is performed after routing tree is constructed. This thesis proposes a time synchronization algorithm combined with single-flooding routing tree construction algorithm in a single path. TSRA (Time Synchronization Routing Algorithm) uses routing packets to construct a routing tree. Two types of time information are added to the routing packet: one is the packet receiving time, and the other is the packet sending time. Time offset and transmission time-delay between parent node and child node could be retrieved from the added time information using LTS (Lightweight Time Synchronization) algorithm. Then parent node sends the time offset and transmission time to children nodes and children nodes can synchronize their time to the parent node time along the routing tree. The performance of proposed algorithm is compared to the TPSN (Timing-sync Protocol for Sensor Networks) which is known to have high accuracy using NS2 simulation tool. The simulation result shows that the accuracy of time synchronization is comparable to TPSN, the synchronization time of all sensor nodes is faster than TPSN, and the energy consumption is less than TPSN.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.37-46
• /
• 2011

Time synchronization plays an important role in mobile communication systems, particularly, when an accurate time-division mechanism among the communication entities is required. We present a new time synchronization algorithm for a wireless mobile ad-hoc network assuming that communication link is managed by a time-slot reservation-based medium access control protocol. The central idea is to reduce time synchronization packet collisions by exploiting the advantages found in reference broadcasting. In addition, we adopt a sophisticated clock updating scheme to ensure the time synchronization convergence. To verify the performance of our algorithm, a set of network simulations has been performed under various mobile ad-hoc network scenarios using the OPNET. The results obtained from the simulations show that the proposed method outperforms the conventional TSF method in terms of synchronization accuracy and convergence time.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.61-69
• /
• 2014

Various Time Synchronization protocols considering for the characteristics of WSN(Wireless Sensor Network) have been developed, because a time relationship plays an important role in many WSN applications, as well. Synchronization accuracy as well as constraints of energy should be considered for WSN Time Synchronization protocols, especially. In this paper, I analyze Time Synchronization protocols for WSN after classifying these protocols with a new criteria (i.e. power consumption). So, this method will contribute to evaluating and comparing WSN Time Synchronization protocols in respect of power consumption.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.953-960
• /
• 2002

Rel-time application programs have constraints which need to be met between media-data. It is client-leading synchronization that is absorbing variable transmission delay time and that is synchronizing by feedback control and palyout control. It is the important factor for playback rate and QoS if the buffer level is normal or not. This paper, The method of maintenance buffer normal state transmits in multimedia server by appling feedback of filtering function. And synchronization method is processing adaptive playout time for smooth presentation without cut-off while media frame is skip. When audio frame which is master media is in upper threshold buffer level we decrease play out time gradually, low threshold buffer level increase it slowly.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.2
• /
• pp.185-192
• /
• 2002

A novel GPS initial synchronization scheme with low hardware complexity is proposed. The proposed method has the decomposed differential matched filter, which consists of 25% multiplier and adder of the conventional matched filter. This paper presents the generalized mean acquisition time of initial synchronization scheme with multiple correlator. It is shown that the proposed method, in spite of its low hardware complexity, has the equal performance to the conventional method. The performance of the proposed method is verified through the simulation test by the GPS simulator. It is shown that the proposed method prevents the squaring loss of non-coherent integration.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1251-1260
• /
• 2002

Real-time application programs have synchronization constraints which need to be met between media-data. Synchronization method represents feedback method including virtual client-side buffer. This buffer is used in buffer level method. It is client-leading synchronization that is absorbing variable transmission delay time and that is synchronizing by feedback control. It is the important factor for playback rate and QoS if the buffer level is normal or not. To solve the problems, we can control the start of transmission in multimedia server by appling filtering, control and network evaluation function. Synchronization method is processing for smooth presentation without cut-off while media is playing out. When audio frame which is master media is in high threshold buffer level we decrease play out time gradually, otherwise we increase it slowly.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1817-1822
• /
• 1991

A method of reducing overhead caused by the processor synchronization process and common memory accesses in finely grained tasks is described. We propose a scheduler which considers the preparation time during searching to minimize the redundant accesses to shared memory. Since the suggested hardware (synchronizer) determines the access order of processors and bus arbitration simultaneously by including the synchronization process into the bus arbitration process, the synchronization time vanishes. Therefore this synchronizer has no overhead caused by the processor synchronization[l]. The proposed scheduler algorithm is processed in parallel. The processes share the upper bound derived by each searching and the lower bound function is built considering the preparation time in order to eliminate as many searches as possible. An application of the proposed method to a multi-DSP system to calculate inverse dynamics for robot arms, showed that the sampling time can be twice shorter than that of the conventional one.