Network-wide clock synchronization via message passing with exponentially distributed link delays

Davide Zennaro, Aitzaz Ahmad, Lorenzo Vangelista, Erchin Serpedin, Hazem Nounou, Mohamed Nounou

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Clock synchronization has become an indispensable requirement in wireless sensor networks due to its central importance in vital network operations such as data fusion and duty cycling, and has attracted considerable research interest recently. Assuming exponentially distributed random delays in a two-way message exchange mechanism, this work proposes a network-wide clock synchronization algorithm using a factor graph representation of the network. Message passing using the max-product algorithm is adopted to derive the update rules for the proposed iterative procedure. A closed form solution is obtained for each node's belief about its clock offset at each iteration. Simulation results show that the application of the proposed message passing-based network-wide clock synchronization algorithm provides convergent estimates for both regular cycle-free and random topologies. Moreover, the mean square error (MSE) performance of the proposed algorithm is also compared with the Cramer-Rao bound (CRB) for small example networks, which further highlights the effectiveness of the proposed algorithm.

Original languageEnglish
Article number6468998
Pages (from-to)2012-2024
Number of pages13
JournalIEEE Transactions on Communications
Volume61
Issue number5
DOIs
Publication statusPublished - 2013

Fingerprint

Message passing
Clocks
Synchronization
Cramer-Rao bounds
Data fusion
Mean square error
Wireless sensor networks
Topology

Keywords

  • Clock synchronization
  • factor graphs
  • max-product algorithm
  • message passing
  • wireless sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Network-wide clock synchronization via message passing with exponentially distributed link delays. / Zennaro, Davide; Ahmad, Aitzaz; Vangelista, Lorenzo; Serpedin, Erchin; Nounou, Hazem; Nounou, Mohamed.

In: IEEE Transactions on Communications, Vol. 61, No. 5, 6468998, 2013, p. 2012-2024.

Research output: Contribution to journalArticle

@article{2351fba756884c3ba5c588d32929cda5,
title = "Network-wide clock synchronization via message passing with exponentially distributed link delays",
abstract = "Clock synchronization has become an indispensable requirement in wireless sensor networks due to its central importance in vital network operations such as data fusion and duty cycling, and has attracted considerable research interest recently. Assuming exponentially distributed random delays in a two-way message exchange mechanism, this work proposes a network-wide clock synchronization algorithm using a factor graph representation of the network. Message passing using the max-product algorithm is adopted to derive the update rules for the proposed iterative procedure. A closed form solution is obtained for each node's belief about its clock offset at each iteration. Simulation results show that the application of the proposed message passing-based network-wide clock synchronization algorithm provides convergent estimates for both regular cycle-free and random topologies. Moreover, the mean square error (MSE) performance of the proposed algorithm is also compared with the Cramer-Rao bound (CRB) for small example networks, which further highlights the effectiveness of the proposed algorithm.",
keywords = "Clock synchronization, factor graphs, max-product algorithm, message passing, wireless sensor networks",
author = "Davide Zennaro and Aitzaz Ahmad and Lorenzo Vangelista and Erchin Serpedin and Hazem Nounou and Mohamed Nounou",
year = "2013",
doi = "10.1109/TCOMM.2013.021913.120595",
language = "English",
volume = "61",
pages = "2012--2024",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Network-wide clock synchronization via message passing with exponentially distributed link delays

AU - Zennaro, Davide

AU - Ahmad, Aitzaz

AU - Vangelista, Lorenzo

AU - Serpedin, Erchin

AU - Nounou, Hazem

AU - Nounou, Mohamed

PY - 2013

Y1 - 2013

N2 - Clock synchronization has become an indispensable requirement in wireless sensor networks due to its central importance in vital network operations such as data fusion and duty cycling, and has attracted considerable research interest recently. Assuming exponentially distributed random delays in a two-way message exchange mechanism, this work proposes a network-wide clock synchronization algorithm using a factor graph representation of the network. Message passing using the max-product algorithm is adopted to derive the update rules for the proposed iterative procedure. A closed form solution is obtained for each node's belief about its clock offset at each iteration. Simulation results show that the application of the proposed message passing-based network-wide clock synchronization algorithm provides convergent estimates for both regular cycle-free and random topologies. Moreover, the mean square error (MSE) performance of the proposed algorithm is also compared with the Cramer-Rao bound (CRB) for small example networks, which further highlights the effectiveness of the proposed algorithm.

AB - Clock synchronization has become an indispensable requirement in wireless sensor networks due to its central importance in vital network operations such as data fusion and duty cycling, and has attracted considerable research interest recently. Assuming exponentially distributed random delays in a two-way message exchange mechanism, this work proposes a network-wide clock synchronization algorithm using a factor graph representation of the network. Message passing using the max-product algorithm is adopted to derive the update rules for the proposed iterative procedure. A closed form solution is obtained for each node's belief about its clock offset at each iteration. Simulation results show that the application of the proposed message passing-based network-wide clock synchronization algorithm provides convergent estimates for both regular cycle-free and random topologies. Moreover, the mean square error (MSE) performance of the proposed algorithm is also compared with the Cramer-Rao bound (CRB) for small example networks, which further highlights the effectiveness of the proposed algorithm.

KW - Clock synchronization

KW - factor graphs

KW - max-product algorithm

KW - message passing

KW - wireless sensor networks

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

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

U2 - 10.1109/TCOMM.2013.021913.120595

DO - 10.1109/TCOMM.2013.021913.120595

M3 - Article

VL - 61

SP - 2012

EP - 2024

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 5

M1 - 6468998

ER -