A factor graph approach to clock offset estimation in wireless sensor networks

Aitzaz Ahmad, Davide Zennaro, Erchin Serpedin, Lorenzo Vangelista

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number6179996
Pages (from-to)4244-4260
Number of pages17
JournalIEEE Transactions on Information Theory
Volume58
Issue number7
DOIs
Publication statusPublished - 2012
Externally publishedYes

Fingerprint

Clocks
Wireless sensor networks
Maximum likelihood estimation
performance
Message passing
Parameter estimation
scenario
simulation
Defects
time

Keywords

  • Clock synchronization
  • estimation bounds
  • factor graphs
  • message passing
  • wireless sensor networks (WSNs)

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

A factor graph approach to clock offset estimation in wireless sensor networks. / Ahmad, Aitzaz; Zennaro, Davide; Serpedin, Erchin; Vangelista, Lorenzo.

In: IEEE Transactions on Information Theory, Vol. 58, No. 7, 6179996, 2012, p. 4244-4260.

Research output: Contribution to journalArticle

Ahmad, Aitzaz ; Zennaro, Davide ; Serpedin, Erchin ; Vangelista, Lorenzo. / A factor graph approach to clock offset estimation in wireless sensor networks. In: IEEE Transactions on Information Theory. 2012 ; Vol. 58, No. 7. pp. 4244-4260.
@article{4bc6125309ee4e819daab85f5feb4eba,
title = "A factor graph approach to clock offset estimation in wireless sensor networks",
abstract = "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.",
keywords = "Clock synchronization, estimation bounds, factor graphs, message passing, wireless sensor networks (WSNs)",
author = "Aitzaz Ahmad and Davide Zennaro and Erchin Serpedin and Lorenzo Vangelista",
year = "2012",
doi = "10.1109/TIT.2012.2194134",
language = "English",
volume = "58",
pages = "4244--4260",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - A factor graph approach to clock offset estimation in wireless sensor networks

AU - Ahmad, Aitzaz

AU - Zennaro, Davide

AU - Serpedin, Erchin

AU - Vangelista, Lorenzo

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Clock synchronization

KW - estimation bounds

KW - factor graphs

KW - message passing

KW - wireless sensor networks (WSNs)

UR - http://www.scopus.com/inward/record.url?scp=84862586982&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862586982&partnerID=8YFLogxK

U2 - 10.1109/TIT.2012.2194134

DO - 10.1109/TIT.2012.2194134

M3 - Article

AN - SCOPUS:84862586982

VL - 58

SP - 4244

EP - 4260

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

M1 - 6179996

ER -