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

Previous low-energy time synchronization methods have mainly focused on reducing the number of transmission or reception packets. However, this paper proposes a method that reduces the percentage of time a node has to be awake (the duty cycle), assuming that a periodic sleep-wake cycle is used to conserve energy. Based on our experience with actual WSN devices, a system model is proposed, and the potential performance of the proposed method, with different parameter values, is analyzed. To further demonstrate the feasibility of our method, experiments were conducted using nine WSN devices in a $3{\times}3$ grid network topology. The results show the average synchronization error is 107.57 $\mu{s}$ in duty cycle 5% and synchronization period 10 sec, and 130 $\mu{s}$ in duty cycle 2.5% and synchronization period 20 sec.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.3
• /
• pp.506-515
• /
• 2015

In this paper, we propose a group playback synchronization method using adaptive synchronization delay time by the bit rate of media to synchronize a play position of streaming media between mobile smart devices. This method consists of streaming server-side and client-side synchronization algorithms based on synchronization delay time which includes connection time, control packet transmission time, streaming data buffering time, and synchronization processing time. We implement the Android media player application with synchronization support using the proposed algorithms and present the result of performance evaluation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.177-178
• /
• 2009

일반적으로 센서 네트워크는 라우팅 트리를 구축한 후에 시간 동기화를 수행한다. 이로 인하여 시간 동기화가 늦어지고 교환하는 패킷이 증가하여 에너지를 많이 소모하는 문제를 유발한다. 본 논문에서는 한 번의 플러딩 과정으로 라우팅 트리를 구축하고 시간 동기화를 이와 동시에 수행하는 알고리즘을 제안한다. 시뮬레이션에 의하여 제안하는 알고리즘은 기존의 동기화 알고리즘인 TPSN과 동등한 수준의 정확도를 보이면서 동기화 속도 및 에너지 소모 면에서 우수하다는 것을 입증하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.194-196
• /
• 2011

일반적으로 센서 네트워크에서는 라우팅 트리를 구축한 후에 시간 동기화 작업을 따로 진행하였다. 그 때문에 패킷교환의 횟수가 늘어나고 전력의 소모를 유발한다. 본 논문에서는 라우팅 트리 구축과정에서 교환하는 정방향과 역방향의 패킷에 LTS(Lightweight Time Synchronization) 알고리즘 연산에 필요한 시간정보를 추가하여 플러딩 라우팅 트리 구축 알고리즘과 시간 동기화 과정을 결합한 알고리즘을 제안한다. 또한 일정한 라운드 시간을 사용하여 클럭 휨으로 인한 시간 오류를 보정하였다. 제안하는 알고리즘이 TPSN(Timing-sync Protocol for Sensor Networks) 방식보다 적은 에너지를 사용하고 센서 노드들 간의 시간을 더욱 정교하게 동기화한다는 것을 NS2 시뮬레이터를 통해서 증명하였다.

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

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.119-126
• /
• 2011

In wireless sensor networks Time synchronization used to be performed after routing tree is constructed. It results in increasing the number of packets and energy consumption. In this paper, we propose a time synchronization algorithm combined with flooding routing tree construction algorithm, which applies LTS (Lightweight Time Synchronization) information packed into the forwarding and backward routing packets. Furthermore, the proposed algorithm compensates the time error due to clock drift using the round time with fixed period. We prove that the proposed algorithm could synchronize the time of among sensor nodes more accurately compared to TSRA (Time Synchronization Routing Algorithm) using NS2 simulation tool.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.668-675
• /
• 2005

With the proliferation of wireless network and the advances of the embedded systems, the traditional distributed systems begin to include the wireless embedded systems. Clock synchronization in the distributed systems is one of the major issues that should be considered for diverse Purposes including synchronization, ordering, and consistency. Many clock synchronization algorithms have been proposed over the years. Since clock synchronization in wireless embedded systems should consider the low bandwidth of a network and the poor resources of a system, most traditional algorithms cannot be applied directly. We propose a clock synchronization algorithm in wireless embedded systems, extending IEEE 802.11 standard. The proposed algorithm can not only achieve high precision by loosening constraints and utilizing the characteristics of wireless broadcast but also provide continuous time synchronization by tolerating the message losses. In master/slave structure the master broadcasts the time information and the stave computes the clock skew and the drift to estimate the synchronized time of the master. The experiment results show that the achieved standard deviation by the Proposed scheme is within the bound of about 200 microseconds.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2208-2220
• /
• 1997

This paper presents a distributed multimedia synchronization algorithm that supports both intramedia and intermedia synchronizations. The intramedia synchronization is achieved by media scaling techniques, and the intermedia synchronization is achieved by variable service rates. We compute the check period between master media's and slave media's relative time stamps for intermedia synchronization. We also evaluate our algorithm through simulations. Simulation results show that our algorithm performs well in both intramedia and intermedia synchronizations.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.9-10
• /
• 2018

SDN 환경에서 여러 컨트롤러의 동기화는 중요한 문제로 대두되었다. 모든 컨트롤러의 네트워크 상태가 동일한지 여부를 확인하려면 컨트롤러를 효율적으로 동기화하기 위한 합의과정이 필요하다. 하지만 합의 과정에서 일어나는 지도자 선출과정이 임의적이기 때문에 시스템 상에서 시간지연이 일어날 수 있다. 본 논문에서 제안하는 우선순위 기반 Raft 알고리즘은 동기화 프로세스를 제어하는 강력한 지도자를 선택하여 동기화로드에서 시간을 절약할 수 있다.

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