Distributed network time synchronization: Social learning versus consensus
dc.contributor.advisor | Kwon, Hyuck M. | |
dc.contributor.author | Hulede, Ian Ellis L. | |
dc.date.accessioned | 2020-09-08T17:27:05Z | |
dc.date.available | 2020-09-08T17:27:05Z | |
dc.date.issued | 2020-07 | |
dc.identifier.other | t20037s | |
dc.identifier.uri | https://soar.wichita.edu/handle/10057/18985 | |
dc.description | Thesis (M.S.)-- Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science | |
dc.description.abstract | The objective of this thesis is to investigate social learning-based distributed network time synchronization (SLDNTS) and compare it to a classic approach: consensus DNTS (CDNTS). To achieve this objective, the thesis introduces a method for generating a practical observation random variable (ORV) for SLDNTS and presents both the worst and best ORV. Then, this thesis shows, through simulations, that SLDNTS is more robust than CDNTS in convergence. CDNTS fails when timing measurement error is nonzero, i.e.,a Gaussian random variable with mean equal to true time and variance equal to one is applied as an observation random variable (ORV) at each node. On the other hand SLDNTS shows quick convergence with small number of iterations even if nonzero timing measurement error, i.e., a Gaussian random variable, is applied. | |
dc.format.extent | x, 30 pages | |
dc.language.iso | en_US | |
dc.publisher | Wichita State University | |
dc.rights | Copyright 2020 by Ian Ellis L. Hulede All Rights Reserved | |
dc.subject.lcsh | Electronic dissertations | |
dc.title | Distributed network time synchronization: Social learning versus consensus | |
dc.type | Thesis |
Files in this item
This item appears in the following Collection(s)
-
Master's Theses
This collection includes Master's theses completed at the Wichita State University Graduate School (Fall 2005 --)