Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss

Kyeong Soo Kim, Seungyeop Kang

TL;DR

The paper tackles clock skew compensation in wireless sensor networks under limited floating-point precision. It introduces a Bresenham's algorithm–inspired, integer-arithmetic scheme that estimates the skew-adjusted increment without floating-point division by mapping the problem to extended Bresenham paths and defining $\overline{\nabla}_i(j)$. The authors prove boundedness properties and provide a unified treatment for $\dfrac{D}{A}<1$ and $\dfrac{D}{A}>1$, supported by numerical results showing tight error bounds relative to double-precision references. This approach enables high-precision time synchronization on resource-constrained nodes, reducing susceptibility to FP precision loss in WSNs.

Abstract

We propose a novel clock skew compensation algorithm based on Bresenham's line drawing algorithm. The proposed algorithm can avoid the effect of limited floating-point precision (e.g., 32-bit single precision) on clock skew compensation and thereby provide high-precision time synchronization even with resource-constrained sensor nodes in wireless sensor networks.

Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss

TL;DR

The paper tackles clock skew compensation in wireless sensor networks under limited floating-point precision. It introduces a Bresenham's algorithm–inspired, integer-arithmetic scheme that estimates the skew-adjusted increment without floating-point division by mapping the problem to extended Bresenham paths and defining . The authors prove boundedness properties and provide a unified treatment for and , supported by numerical results showing tight error bounds relative to double-precision references. This approach enables high-precision time synchronization on resource-constrained nodes, reducing susceptibility to FP precision loss in WSNs.

Abstract

We propose a novel clock skew compensation algorithm based on Bresenham's line drawing algorithm. The proposed algorithm can avoid the effect of limited floating-point precision (e.g., 32-bit single precision) on clock skew compensation and thereby provide high-precision time synchronization even with resource-constrained sensor nodes in wireless sensor networks.

Paper Structure

This paper contains 8 sections, 3 theorems, 19 equations, 3 figures, 1 table.

Table of Contents

  1. Introduction
  2. Clock Models
  3. Clock Skew Compensation based on Bresenham's Algorithm
  4. Numerical Examples
  5. Conclusions
  6. Proof of Lemma 1
  7. Proof of Lemma \ref{['lem:td_reachability']}
  8. Proof of Theorem \ref{['thm:clock_skew_compensation']}

Key Result

Lemma 1

$\triangledown_{i}$ satisfies the following inequality:

Figures (3)

  • Figure 1: Clock skew compensation based on Bresenham's line drawing algorithm bresenham65:_algor for the case of $\frac{\Delta{b}}{\Delta{a}}{<}1$.
  • Figure 2: Example of all possible paths from the origin to a given destination point based on $M_{1}$ and $M_{2}$ movements.
  • Figure 3: Example of common starting points reaching all possible candidate points for the case of $\frac{\Delta{b}}{\Delta{a}}{<}1$.

Theorems & Definitions (6)

  • Lemma 1
  • Definition 1
  • Definition 2
  • Definition 3
  • Lemma 2
  • Theorem 1