Previous Abstract Return to Session A4 Next Abstract

Session A4: Novel Timing Technologies and Applications

Distributed Network Time Synchronization: Social Learning versus Consensus
Hyuck M. Kwon and Ian Ellis L. Hulede, Wichita State University, EECS
Location: Ballroom E
Date/Time: Wednesday, Aug. 25, 11:50 a.m.

The objective of this paper is to investigate a social learning-based distributed network time synchronization (SLDNTS) and compare it to a classic approach: consensus-based distributed network time synchronization (CDNTS). An observation random variable (ORV), which is a conditional likelihood (e.g., Gaussian) given a synchronized true time hypothesis, is used to generate clock times at each node and each iteration. Time offset and time quality of node clocks are represented, respectively, by a mean shift from the true time and variance of a Gaussian random variable (RV) to consider a practical environment. Then, this paper proposes a simple method to construct an observation matrix that satisfies both the identifiability condition (IC) and the prevailing observation signal existence condition (POSEC) required for the social learning (SL). Each node quantizes its ORV into a heads and tails Bernoulli RV with (1-epsilon) and
epsilon probability, respectively, where epsilon is a control parameter for the SLDNTS convergence speed. Using this proposed observation matrix, each node computes its intermediate belief on each possible time hypothesis, shares the information with its connected neighbor nodes, and updates its belief probabilities. Then, this paper verifies, through simulation, that the proposed SLDNTS shows superior performance compared to the classic CDNTS under the same observation environment.



Previous Abstract Return to Session A4 Next Abstract