A Factor Graph Approach to Clock Offset Estimation in Wireless Sensor Networks

被引:30
作者
Ahmad, Aitzaz [1 ]
Zennaro, Davide [2 ]
Serpedin, Erchin [1 ]
Vangelista, Lorenzo [2 ]
机构
[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA
[2] Univ Padua, Dept Informat Engn, I-35131 Padua, Italy
关键词
Clock synchronization; estimation bounds; factor graphs; message passing; wireless sensor networks (WSNs); MAXIMUM-LIKELIHOOD-ESTIMATION; SYNCHRONIZATION ALGORITHMS; TIME; BOUNDS; SKEW;
D O I
10.1109/TIT.2012.2194134
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of clock offset estimation in a two-way timing message exchange regime is considered when the likelihood function of the observation time stamps is Gaussian, exponential, or log-normally distributed. A parameterized solution to the maximum likelihood (ML) estimation of clock offset is analytically obtained, which differs from the earlier approaches where the likelihood function is maximized graphically. In order to capture the imperfections in node oscillators, which may render a time-varying nature to the clock offset, a novel Bayesian approach to the clock offset estimation is proposed by using a factor graph representation of the posterior density. Message passing using the max-product algorithm yields an exact expression for the Bayesian inference problem. Several lower bounds on the variance of an estimator are derived for arbitrary exponential family distributed likelihood functions which, while serving as stepping stones to benchmark the performance of the proposed clock offset estimators, can be useful in their own right in classical as well Bayesian parameter estimation theory. To corroborate the theoretical findings, extensive simulation results are discussed for classical as well as Bayesian estimators in various scenarios. It is observed that the performance of the proposed estimators is fairly close to the fundamental limits established by the lower bounds.
引用
收藏
页码:4244 / 4260
页数:17
相关论文
共 34 条
[1]   Analysis of synchronization algorithms with time-out control over networks with exponentially symmetric delays [J].
Abdel-Ghaffar, HS .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (10) :1652-1661
[2]  
Ahmad Aitzaz, 2010, Proceedings of the 2010 20th International Conference on Pattern Recognition (ICPR 2010), P2322, DOI 10.1109/ICPR.2010.568
[3]   A Bayesian view of the Hammersley-Chapman-Robbins-type inequality [J].
Akahira, M. ;
Ohyauchi, N. .
STATISTICS, 2007, 41 (02) :137-144
[4]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[6]  
[Anonymous], 2004, Proceedings of International Conference on Embedded Networked Sensor Systems (Sensys), DOI [10.1145/1031495.1031501, DOI 10.1145/1031495.1031501]
[7]  
[Anonymous], 2007, Bayesian Bounds for Parameter Estimation and Nonlinear Filtering/Tracking, DOI [DOI 10.1109/9780470544198.CH39, 10.1109/9780470544198.ch39]
[8]  
[Anonymous], 1993, ESIMATION THEORY
[9]  
[Anonymous], 2003, Proceedings of the 1st International Conference on Embedded Networks Sensor Systems (SenSys'03), DOI DOI 10.1145/958491.958508
[10]  
Barooah P., 2005, Proceedings. Third International Conference on Intelligent Sensing and Information Processing (IEEE Cat. No. 05EX1239), P226