Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach

This paper proposes novel randomized gossip-consensus-based sync (RGCS) algorithms to realize efficient time calibration in dynamic wireless sensor networks (WSNs). First, the unreliable links are described by stochastic connections, reflecting the characteristic of changing connectivity gleaned fro...

Full description

Saved in:
Bibliographic Details
Main Authors: Nan Xiong, Minrui Fei, Taicheng Yang, Yu-Chu Tian
Format: Article
Language:English
Published: Wiley 2018-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2018/4283087
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832563746114895872
author Nan Xiong
Minrui Fei
Taicheng Yang
Yu-Chu Tian
author_facet Nan Xiong
Minrui Fei
Taicheng Yang
Yu-Chu Tian
author_sort Nan Xiong
collection DOAJ
description This paper proposes novel randomized gossip-consensus-based sync (RGCS) algorithms to realize efficient time calibration in dynamic wireless sensor networks (WSNs). First, the unreliable links are described by stochastic connections, reflecting the characteristic of changing connectivity gleaned from dynamic WSNs. Secondly, based on the mutual drift estimation, each pair of activated nodes fully adjusts clock rate and offset to achieve network-wide time synchronization by drawing upon the gossip consensus approach. The converge-to-max criterion is introduced to achieve a much faster convergence speed. The theoretical results on the probabilistic synchronization performance of the RGCS are presented. Thirdly, a Revised-RGCS is developed to counteract the negative impact of bounded delays, because the uncertain delays are always present in practice and would lead to a large deterioration of algorithm performances. Finally, extensive simulations are performed on the MATLAB and OMNeT++ platform for performance evaluation. Simulation results demonstrate that the proposed algorithms are not only efficient for synchronization issues required for dynamic topology changes but also give a better performance in terms of converging speed, collision rate, and the robustness of resisting delay, and outperform other existing protocols.
format Article
id doaj-art-168b7de6116d4d29bc65a2036b560f9d
institution Kabale University
issn 1076-2787
1099-0526
language English
publishDate 2018-01-01
publisher Wiley
record_format Article
series Complexity
spelling doaj-art-168b7de6116d4d29bc65a2036b560f9d2025-02-03T01:12:39ZengWileyComplexity1076-27871099-05262018-01-01201810.1155/2018/42830874283087Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based ApproachNan Xiong0Minrui Fei1Taicheng Yang2Yu-Chu Tian3Shanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics Engineering and Automation, Shanghai University, Shanghai 200072, ChinaShanghai Key Laboratory of Power Station Automation Technology, School of Mechatronics Engineering and Automation, Shanghai University, Shanghai 200072, ChinaDepartment of Engineering and Design, University of Sussex, Brighton BN1 9QT, UKSchool of Electrical Engineering and Computer Science, Queensland University of Technology, GPO Box 2434, Brisbane QLD 4001, AustraliaThis paper proposes novel randomized gossip-consensus-based sync (RGCS) algorithms to realize efficient time calibration in dynamic wireless sensor networks (WSNs). First, the unreliable links are described by stochastic connections, reflecting the characteristic of changing connectivity gleaned from dynamic WSNs. Secondly, based on the mutual drift estimation, each pair of activated nodes fully adjusts clock rate and offset to achieve network-wide time synchronization by drawing upon the gossip consensus approach. The converge-to-max criterion is introduced to achieve a much faster convergence speed. The theoretical results on the probabilistic synchronization performance of the RGCS are presented. Thirdly, a Revised-RGCS is developed to counteract the negative impact of bounded delays, because the uncertain delays are always present in practice and would lead to a large deterioration of algorithm performances. Finally, extensive simulations are performed on the MATLAB and OMNeT++ platform for performance evaluation. Simulation results demonstrate that the proposed algorithms are not only efficient for synchronization issues required for dynamic topology changes but also give a better performance in terms of converging speed, collision rate, and the robustness of resisting delay, and outperform other existing protocols.http://dx.doi.org/10.1155/2018/4283087
spellingShingle Nan Xiong
Minrui Fei
Taicheng Yang
Yu-Chu Tian
Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach
Complexity
title Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach
title_full Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach
title_fullStr Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach
title_full_unstemmed Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach
title_short Randomized and Efficient Time Synchronization in Dynamic Wireless Sensor Networks: A Gossip-Consensus-Based Approach
title_sort randomized and efficient time synchronization in dynamic wireless sensor networks a gossip consensus based approach
url http://dx.doi.org/10.1155/2018/4283087
work_keys_str_mv AT nanxiong randomizedandefficienttimesynchronizationindynamicwirelesssensornetworksagossipconsensusbasedapproach
AT minruifei randomizedandefficienttimesynchronizationindynamicwirelesssensornetworksagossipconsensusbasedapproach
AT taichengyang randomizedandefficienttimesynchronizationindynamicwirelesssensornetworksagossipconsensusbasedapproach
AT yuchutian randomizedandefficienttimesynchronizationindynamicwirelesssensornetworksagossipconsensusbasedapproach