Efficient algorithms and performance bounds for clock synchronization in wireless sensor networks

Qasim M. Chaudhari, Erchin Serpedin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Extending the idea of having silent nodes in a Wireless Sensor Network (WSN) overhear the two-way timing message communication between two active (master and slave) nodes, this paper focuses on deriving the Maximum Likelihood Estimator (MLE) and performance lower bounds for the clock offsets of the listening nodes located within the communication range of the active nodes by assuming an exponential link delay modeling. Hence, synchronization with the reference node is achieved at a very low cost.The MLE is also shown to be the minimum variance unbiased estimator of the clock offset when the mean of exponential link delays is known. Since it is attractive to know in advance the extent to which an estimator can perform relative to global performance lower bounds, the Chapman-Robbins and Barankin bounds for the clock offset estimator are derived. It is shown that for an exponential link delay model, the mean square error of the unbiased clock offset estimator is inversely proportional to the square of the number of observations, and hence its performance is on a similar scale, albeit slightly lesser, as compared to the usual sender-receiver clock offset estimator.

Original languageEnglish
Title of host publicationIEEE Information Theory Workshop 2010, ITW 2010
DOIs
Publication statusPublished - 2010
Externally publishedYes
EventIEEE Information Theory Workshop 2010, ITW 2010 - Cairo, Egypt
Duration: 6 Jan 20108 Jan 2010

Other

OtherIEEE Information Theory Workshop 2010, ITW 2010
CountryEgypt
CityCairo
Period6/1/108/1/10

Fingerprint

Clock Synchronization
Performance Bounds
Wireless Sensor Networks
Clocks
Wireless sensor networks
Synchronization
Efficient Algorithms
Estimator
Vertex of a graph
Maximum Likelihood Estimator
Maximum likelihood
Minimum Variance Unbiased Estimator
Lower bound
Communication
Mean square error
Timing
Receiver
Directly proportional
Modeling
Range of data

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Efficient algorithms and performance bounds for clock synchronization in wireless sensor networks. / Chaudhari, Qasim M.; Serpedin, Erchin.

IEEE Information Theory Workshop 2010, ITW 2010. 2010. 5503194.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chaudhari, QM & Serpedin, E 2010, Efficient algorithms and performance bounds for clock synchronization in wireless sensor networks. in IEEE Information Theory Workshop 2010, ITW 2010., 5503194, IEEE Information Theory Workshop 2010, ITW 2010, Cairo, Egypt, 6/1/10. https://doi.org/10.1109/ITWKSPS.2010.5503194
Chaudhari, Qasim M. ; Serpedin, Erchin. / Efficient algorithms and performance bounds for clock synchronization in wireless sensor networks. IEEE Information Theory Workshop 2010, ITW 2010. 2010.
@inproceedings{0a91937a60cc43bcaafd1e7693b5d989,
title = "Efficient algorithms and performance bounds for clock synchronization in wireless sensor networks",
abstract = "Extending the idea of having silent nodes in a Wireless Sensor Network (WSN) overhear the two-way timing message communication between two active (master and slave) nodes, this paper focuses on deriving the Maximum Likelihood Estimator (MLE) and performance lower bounds for the clock offsets of the listening nodes located within the communication range of the active nodes by assuming an exponential link delay modeling. Hence, synchronization with the reference node is achieved at a very low cost.The MLE is also shown to be the minimum variance unbiased estimator of the clock offset when the mean of exponential link delays is known. Since it is attractive to know in advance the extent to which an estimator can perform relative to global performance lower bounds, the Chapman-Robbins and Barankin bounds for the clock offset estimator are derived. It is shown that for an exponential link delay model, the mean square error of the unbiased clock offset estimator is inversely proportional to the square of the number of observations, and hence its performance is on a similar scale, albeit slightly lesser, as compared to the usual sender-receiver clock offset estimator.",
author = "Chaudhari, {Qasim M.} and Erchin Serpedin",
year = "2010",
doi = "10.1109/ITWKSPS.2010.5503194",
language = "English",
isbn = "9781424463725",
booktitle = "IEEE Information Theory Workshop 2010, ITW 2010",

}

TY - GEN

T1 - Efficient algorithms and performance bounds for clock synchronization in wireless sensor networks

AU - Chaudhari, Qasim M.

AU - Serpedin, Erchin

PY - 2010

Y1 - 2010

N2 - Extending the idea of having silent nodes in a Wireless Sensor Network (WSN) overhear the two-way timing message communication between two active (master and slave) nodes, this paper focuses on deriving the Maximum Likelihood Estimator (MLE) and performance lower bounds for the clock offsets of the listening nodes located within the communication range of the active nodes by assuming an exponential link delay modeling. Hence, synchronization with the reference node is achieved at a very low cost.The MLE is also shown to be the minimum variance unbiased estimator of the clock offset when the mean of exponential link delays is known. Since it is attractive to know in advance the extent to which an estimator can perform relative to global performance lower bounds, the Chapman-Robbins and Barankin bounds for the clock offset estimator are derived. It is shown that for an exponential link delay model, the mean square error of the unbiased clock offset estimator is inversely proportional to the square of the number of observations, and hence its performance is on a similar scale, albeit slightly lesser, as compared to the usual sender-receiver clock offset estimator.

AB - Extending the idea of having silent nodes in a Wireless Sensor Network (WSN) overhear the two-way timing message communication between two active (master and slave) nodes, this paper focuses on deriving the Maximum Likelihood Estimator (MLE) and performance lower bounds for the clock offsets of the listening nodes located within the communication range of the active nodes by assuming an exponential link delay modeling. Hence, synchronization with the reference node is achieved at a very low cost.The MLE is also shown to be the minimum variance unbiased estimator of the clock offset when the mean of exponential link delays is known. Since it is attractive to know in advance the extent to which an estimator can perform relative to global performance lower bounds, the Chapman-Robbins and Barankin bounds for the clock offset estimator are derived. It is shown that for an exponential link delay model, the mean square error of the unbiased clock offset estimator is inversely proportional to the square of the number of observations, and hence its performance is on a similar scale, albeit slightly lesser, as compared to the usual sender-receiver clock offset estimator.

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

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

U2 - 10.1109/ITWKSPS.2010.5503194

DO - 10.1109/ITWKSPS.2010.5503194

M3 - Conference contribution

SN - 9781424463725

BT - IEEE Information Theory Workshop 2010, ITW 2010

ER -