State-Based Synchronization Protocol in Sensor Networks

DOI

10.2991/jcis.2006.41How to use a DOI?

Keywords

Drift, Sensor Networks, Synchronization Period, Time Synchronization

Abstract

Some applications of the sensor network require precise time synchronization among local clocks of the sensors. Due to the limited resource in the sensor network, it is not trivial to maintain the said synchronization. In this paper, we propose a novel method, referred to as the state-based synchronization protocol (SBSP) to solve this issue. We create a finite state machine in the SBSP to describe the synchronization actions at each sensor node. Specifically, the SBSP makes use of the ADV, REQ and SYNC packets and the finite state machine to achieve synchronization. We will compare the performance of the proposed protocol against the popular timing-sync protocol for sensor networks (TPSN) and lightweight tree-based synchronization (LTS) through simulations. The SBSP reduces the redundant message exchanges in the TPSN. It is shown that the SBSP saves power with less message exchanges while maintaining better synchronization error.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Shang-Chih Hsu
AU  - Wei Yen
PY  - 2006/10
DA  - 2006/10
TI  - State-Based Synchronization Protocol in Sensor Networks
BT  - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SP  - 167
EP  - 171
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.41
DO  - 10.2991/jcis.2006.41
ID  - Hsu2006/10
ER  -