Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Peer to Peer Clock Synchronization in Wireless Sensor Networks


J. Schulze

Semester Thesis, HS15 (10490)

Clock synchronization is essential for certain applications (e.g. surveillance, TDMA). In wireless sensor networks conventional ways to achieve clock synchronization cannot be employed because of the lack of a reference time (e.g. no internet connection, no GPS) and because the limited computational resources make the common algorithms like PTP etc. impractical. A much simpler algorithm that does not need a reference time is the RandSync algorithm. It was proven that the algorithm converges for a certain set of parameters but it is not clear how to tune these parameters in a distributed way. In this work we show heuristics which we can use to determine these parameters in a distributed network. We evaluate dierent heuristics via simulations. Then we show that the algorithm is robust with respect to dierences in the choice of these parameters between dierent nodes. At last we show some experimental results of the RandSync Algorithm where we use one of the introduced heuristics to determine the missing parameters.

Supervisors: Saverio Bolognani, Florian Dörfler


Type of Publication:

(13)Semester/Bachelor Thesis

F. Dörfler

File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@PhdThesis { Xxx:2016:IFA_5399
Permanent link