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

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

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.69-72
• /
• 2013

본 논문은 TPSN 알고리즘의 시각 동기화 오차를 개선하기 위하여 Imote2 센서 노드의 클럭 드리프트 특성을 적용하는 개선된 TPSN 알고리즘을 제안한다. 클럭 드리프트의 원인은 주로 수정발진기에 기인한다. 본 연구에서는 온도 및 습도 등 환경 조건이 비슷할 경우에 드리프트가 크게 차이나지 않는다는 실험 결과에 따라 드리프트의 평균값을 구하고 이를 TPSN 동기화 오차 보정에 사용한다. 이때 적용되는 드리프트 특성 값은 센서 노드 설치 이전에 미리 측정하여야 한다. 실험을 통하여 본 논문에서 제안한 개선된 TPSN 알고리즘이 동기화 오차 개선에 효과적임을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.274-281
• /
• 2006

Sensor network applications need synchronized time extremely such as object tracking, consistent state updates, duplicate detection, and temporal order delivery. This paper describes reliable time synchronization protocol (RTSP) for wireless sensor networks. In the proposed method, synchronization error is decreased by creating hierarchical tree with lower depth and reliability is improved by maintaining and updating information of candidate parent nodes. The RTSP reduces recovery time and communication overheads comparing to TPSN when there are topology changes owing to moving of nodes, running out of energy and physical crashes. Simulation results show that RTSP has about 20% better performance than TPSN in synchronization accuracy. And the number of message in the RTSP is $20%{\sim}60%$ lower than that in the TPSN when nodes are failed in the network. In case of different transmission range of nodes, the communication overhead in the RTSP is reduced up to 40% than that in the TPSN at the maximum.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1084-1093
• /
• 2012

For large multihop networks, large time synchronization (TS) errors can accumulate with conventional methods, such as TPSN, RBS, and FTSP, since they need a large number of hops to cover the network. In this paper, a method combining Concurrent Cooperative Transmission (CCT) and Semi- Cooperative Spectrum Fusion (SCSF) is proposed to reduce the number of hops to cover the large network. In CCT, cooperating nodes transmit the same digitally encoded message in orthogonal channels simultaneously, so receivers can benefit from array and diversity gains. SCSF is an analog cooperative transmission method where different cooperators transmit correlated information simultaneously. The two methods are combined to create a new distributed method of network TS, called the Cooperative Analog and Digital (CANDI) TS protocol, which promises significantly lower network TS errors in multi-hop networks. CANDI and TPSN are compared in simulation for a line network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9A
• /
• pp.868-877
• /
• 2006

Sensor network applications need synchronized time to the highest degree such as object tracking, consistent state updates, duplicate detection, and temporal order delivery. In addition, reliability issues and fault tolerance in sophisticated sensor networks have become a critical area of research today. In this paper, we proposed a fault tolerant clock management scheme in sensor networks considering two cases of fault model such as network faults and clock faults. The proposed scheme restricts the propagation of synchronization error when there are clock faults of nodes such as rapid fluctuation, severe changes in drift rate, and so on. In addition, it handles topology changes. Simulation results show that the proposed method has about $1.5{\sim}2.0$ times better performance than TPSN in the presence of faults.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.37-50
• /
• 2009

In this paper, we proposed a mechanism for effective cooperation in sensor network. There are a few mechanism like RBS, TPSN, FPSN for sensor network. However these are supporting synchronization among nodes without global state. Therefore, we proposed SGSM(Simple Global State Management) to maintain global state among sensor nodes. As experimental results, we confirmed loss rate is within 1% as maintaining global state with SGSM mechanism. In this paper, we defined global state in sensor network and introduced SGSM for improving timming accuracy in sensor environment.

• 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 시뮬레이터를 통해서 증명하였다.