Convergence of Desynchronization Primitives in Wireless Sensor Networks: A Stochastic Modeling Approach

DOI10.1109/TSP.2014.2369003zbMATH Open1394.94094arXiv1411.2862OpenAlexW1994717601MaRDI QIDQ4579673FDOQ4579673

Dujdow Buranapanichkit, Yiannis Andreopoulos, Nikos Deligiannis

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: Desynchronization approaches in wireless sensor networks converge to time-division multiple access (TDMA) of the shared medium without requiring clock synchronization amongst the wireless sensors, or indeed the presence of a central (coordinator) node. All such methods are based on the principle of reactive listening of periodic "fire" or "pulse" broadcasts: each node updates the time of its fire message broadcasts based on received fire messages from some of the remaining nodes sharing the given spectrum. In this paper, we present a novel framework to estimate the required iterations for convergence to fair TDMA scheduling. Our estimates are fundamentally different from previous conjectures or bounds found in the literature as, for the first time, convergence to TDMA is defined in a stochastic sense. Our analytic results apply to the Desync algorithm and to pulse-coupled oscillator algorithms with inhibitory coupling. The experimental evaluation via iMote2 TinyOS nodes (based on the IEEE 802.15.4 standard) as well as via computer simulations demonstrates that, for the vast majority of settings, our stochastic model is within one standard deviation from the experimentally-observed convergence iterations. The proposed estimates are thus shown to characterize the desynchronization convergence iterations significantly better than existing conjectures or bounds. Therefore, they contribute towards the analytic understanding of how a desynchronization-based system is expected to evolve from random initial conditions to the desynchronized steady state.

Full work available at URL: https://arxiv.org/abs/1411.2862

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (4)

• Consensus for wireless sensor networks with Markovian switching topology and stochastic communication noises
• A Stochastic Time-Domain Model for Burst Data Aggregation in IEEE 802.15.4 Wireless Sensor Networks
• Monotonic Mean-Squared Convergence Conditions for Random Pairwise Consensus Synchronization in Wireless Networks
• Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem

   Recommendations

• Monotonic Mean-Squared Convergence Conditions for Random Pairwise Consensus Synchronization in Wireless Networks 👍 👎
• Consensus for wireless sensor networks with Markovian switching topology and stochastic communication noises 👍 👎
• Towards a dynamical model for wireless sensor networks 👍 👎
• Algorithmic Aspects of Wireless Sensor Networks 👍 👎
• Convergence of gossip algorithms for consensus in wireless sensor networks with intermittent links and mobile nodes 👍 👎
• Self-organizing Desynchronization and TDMA on Wireless Sensor Networks 👍 👎
• Consensus in Correlated Random Wireless Sensor Networks 👍 👎
• Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem 👍 👎

This page was built for publication: Convergence of Desynchronization Primitives in Wireless Sensor Networks: A Stochastic Modeling Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579673)