By Topic

A Greedy Distributed Time Synchronization Algorithm for Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
K. -Y. Cheng ; Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, Hong Kong ; K. -S. Lui ; Y. -C. Wu ; V. Tam

In this paper, a distributed network-wise synchronization protocol is presented. The protocol employs Pairwise Broadcast Synchronization (PBS) in which sensors can be synchronized by merely overhearing the exchange of synchronization packets. We investigate how to minimize the number of PBS required to synchronize all nodes in a network. We show that the problem of finding the minimum number of PBS required is NP-complete. A distributed greedy algorithm is proposed. The protocol is tested by extensive simulations. Although the algorithm behind is heuristic-based, the performance is closed to the centralized algorithm. The message overhead is compared with that of Timing-Sync Protocol for Sensor Networks (TPSN).

Published in:

2008 IEEE International Conference on Communications

Date of Conference:

19-23 May 2008