Robust clock synchronization in wireless sensor networks through noise density estimation

Jang Sub Kim, Jaehan Lee, Erchin Serpedin, Khalid Qaraqe

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Assuming that the network delays are normally distributed and the network nodes are subject to clock phase offset errors, the maximum likelihood estimator (MLE) and the Kalman filter (KF) have been recently proposed with the goal of maximizing the clock synchronization accuracy in wireless sensor networks (WSNs). However, because the network delays may assume any distribution and the performance of MLE and KF is quite sensitive to the distribution of network delays, designing clock synchronization algorithms that are robust to arbitrary network delay distributions appears as an important problem. Adopting a Bayesian framework, this paper proposes a novel clock synchronization algorithm, called the Iterative Gaussian mixture Kalman particle filter (IGMKPF), which combines the Gaussian mixture Kalman particle filter (GMKPF) with an iterative noise density estimation procedure to achieve robust performance in the presence of unknown network delay distributions. The Kullback-Leibler divergence is used as a measure to assess the departure of estimated observation noise density from its true expression. The posterior Cramér-Rao bound (PCRB) and the mean-square error (MSE) of IGMKPF are evaluated via computer simulations. It is shown that IGMKPF exhibits improved performance and robustness relative to MLE. The prior information plays an important role in IGMKPF. A MLE-based method for obtaining reliable prior information for clock phase offsets is presented and shown to ensure the convergence of IGMKPF.

Original languageEnglish
Article number5746655
Pages (from-to)3035-3047
Number of pages13
JournalIEEE Transactions on Signal Processing
Volume59
Issue number7
DOIs
Publication statusPublished - Jul 2011
Externally publishedYes

Fingerprint

Clocks
Wireless sensor networks
Synchronization
Maximum likelihood
Kalman filters
Mean square error
Computer simulation

Keywords

  • Clock synchronization
  • Cramér-Rao bound
  • filter
  • Kalman
  • particle filter
  • wireless sensor networks (WSNs)

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Robust clock synchronization in wireless sensor networks through noise density estimation. / Kim, Jang Sub; Lee, Jaehan; Serpedin, Erchin; Qaraqe, Khalid.

In: IEEE Transactions on Signal Processing, Vol. 59, No. 7, 5746655, 07.2011, p. 3035-3047.

Research output: Contribution to journalArticle

@article{6746882e4847480290eeb851c8b1eac9,
title = "Robust clock synchronization in wireless sensor networks through noise density estimation",
abstract = "Assuming that the network delays are normally distributed and the network nodes are subject to clock phase offset errors, the maximum likelihood estimator (MLE) and the Kalman filter (KF) have been recently proposed with the goal of maximizing the clock synchronization accuracy in wireless sensor networks (WSNs). However, because the network delays may assume any distribution and the performance of MLE and KF is quite sensitive to the distribution of network delays, designing clock synchronization algorithms that are robust to arbitrary network delay distributions appears as an important problem. Adopting a Bayesian framework, this paper proposes a novel clock synchronization algorithm, called the Iterative Gaussian mixture Kalman particle filter (IGMKPF), which combines the Gaussian mixture Kalman particle filter (GMKPF) with an iterative noise density estimation procedure to achieve robust performance in the presence of unknown network delay distributions. The Kullback-Leibler divergence is used as a measure to assess the departure of estimated observation noise density from its true expression. The posterior Cram{\'e}r-Rao bound (PCRB) and the mean-square error (MSE) of IGMKPF are evaluated via computer simulations. It is shown that IGMKPF exhibits improved performance and robustness relative to MLE. The prior information plays an important role in IGMKPF. A MLE-based method for obtaining reliable prior information for clock phase offsets is presented and shown to ensure the convergence of IGMKPF.",
keywords = "Clock synchronization, Cram{\'e}r-Rao bound, filter, Kalman, particle filter, wireless sensor networks (WSNs)",
author = "Kim, {Jang Sub} and Jaehan Lee and Erchin Serpedin and Khalid Qaraqe",
year = "2011",
month = "7",
doi = "10.1109/TSP.2011.2141660",
language = "English",
volume = "59",
pages = "3035--3047",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Robust clock synchronization in wireless sensor networks through noise density estimation

AU - Kim, Jang Sub

AU - Lee, Jaehan

AU - Serpedin, Erchin

AU - Qaraqe, Khalid

PY - 2011/7

Y1 - 2011/7

N2 - Assuming that the network delays are normally distributed and the network nodes are subject to clock phase offset errors, the maximum likelihood estimator (MLE) and the Kalman filter (KF) have been recently proposed with the goal of maximizing the clock synchronization accuracy in wireless sensor networks (WSNs). However, because the network delays may assume any distribution and the performance of MLE and KF is quite sensitive to the distribution of network delays, designing clock synchronization algorithms that are robust to arbitrary network delay distributions appears as an important problem. Adopting a Bayesian framework, this paper proposes a novel clock synchronization algorithm, called the Iterative Gaussian mixture Kalman particle filter (IGMKPF), which combines the Gaussian mixture Kalman particle filter (GMKPF) with an iterative noise density estimation procedure to achieve robust performance in the presence of unknown network delay distributions. The Kullback-Leibler divergence is used as a measure to assess the departure of estimated observation noise density from its true expression. The posterior Cramér-Rao bound (PCRB) and the mean-square error (MSE) of IGMKPF are evaluated via computer simulations. It is shown that IGMKPF exhibits improved performance and robustness relative to MLE. The prior information plays an important role in IGMKPF. A MLE-based method for obtaining reliable prior information for clock phase offsets is presented and shown to ensure the convergence of IGMKPF.

AB - Assuming that the network delays are normally distributed and the network nodes are subject to clock phase offset errors, the maximum likelihood estimator (MLE) and the Kalman filter (KF) have been recently proposed with the goal of maximizing the clock synchronization accuracy in wireless sensor networks (WSNs). However, because the network delays may assume any distribution and the performance of MLE and KF is quite sensitive to the distribution of network delays, designing clock synchronization algorithms that are robust to arbitrary network delay distributions appears as an important problem. Adopting a Bayesian framework, this paper proposes a novel clock synchronization algorithm, called the Iterative Gaussian mixture Kalman particle filter (IGMKPF), which combines the Gaussian mixture Kalman particle filter (GMKPF) with an iterative noise density estimation procedure to achieve robust performance in the presence of unknown network delay distributions. The Kullback-Leibler divergence is used as a measure to assess the departure of estimated observation noise density from its true expression. The posterior Cramér-Rao bound (PCRB) and the mean-square error (MSE) of IGMKPF are evaluated via computer simulations. It is shown that IGMKPF exhibits improved performance and robustness relative to MLE. The prior information plays an important role in IGMKPF. A MLE-based method for obtaining reliable prior information for clock phase offsets is presented and shown to ensure the convergence of IGMKPF.

KW - Clock synchronization

KW - Cramér-Rao bound

KW - filter

KW - Kalman

KW - particle filter

KW - wireless sensor networks (WSNs)

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

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

U2 - 10.1109/TSP.2011.2141660

DO - 10.1109/TSP.2011.2141660

M3 - Article

VL - 59

SP - 3035

EP - 3047

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 7

M1 - 5746655

ER -