arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.01769eess.SP
收藏

无线网络中基于低秩近似的鲁棒时钟同步

Robust Clock Synchronization via Low Rank Approximation in Wireless Networks

Osama Elnahas, Zhi Quan

摘要:

时钟同步在无线网络的许多应用中起着至关重要的作用,已成为无线网络的一个关键设计目标。然而,由于无线链路由于不可靠的信道条件而易于发生随机网络延迟,因此通常难以在无线节点之间实现精确的时钟同步。这封信提出了鲁棒的时钟同步算法的基础上,低秩矩阵近似,这是能够正确的时间戳存在随机网络延迟。我们设计了一个基于低秩近似的最大似然估计器(MLE),联合估计的时钟偏移和时钟偏差下的双向消息交换机制假设高斯延迟分布。通过将时间戳校正问题公式化为低秩近似问题,我们可以在奇异值分解(SVD)域中以及通过核范数最小化来解决该问题。数值结果表明,所提出的方案可以纠正噪声的时间戳,从而实现更强大的同步性能比最大似然估计。

英文摘要:

Clock synchronization has become a key design objective in wireless networks for its essential importance in many applications. However, as the wireless link is prone to random network delays due to unreliable channel conditions, it is in general difficult to achieve accurate clock synchronization among wireless nodes. This letter proposes robust clock synchronization algorithms based on low rank matrix approximation, which are able to correct timestamps in the presence of random network delays. We design a low rank approximation based maximum likelihood estimator (MLE) to jointly estimate the clock offset and clock skew under the two-way message exchange mechanism assuming Gaussian delay distribution. By formulating the timestamp correction problem into a low rank approximation problem, we can solve the problem in the singular value decomposition (SVD) domain and also via nuclear norm minimization. Numerical results show that the proposed schemes can correct noisy timestamps and thus achieve more robust synchronization performance than the MLE.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑