Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

Arshad Jhumka, Matthew Bradbury, Sain Saginbekov

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

This paper investigates the design of fault-tolerant TDMA-based data aggregation scheduling (DAS) protocols for wireless sensor networks (WSNs). DAS is a fundamental pattern of communication in wireless sensor networks where sensor nodes aggregate and relay data to a sink node. However, any such DAS protocol needs to be cognisant of the fact that crash failures can occur. We make the following contributions: (i) we identify a necessary condition to solve the DAS problem, (ii) we introduce a strong and weak version of the DAS problem, (iii) we show several impossibility results due to the crash failures, (iv) we develop a modular local algorithm that solves stabilising weak DAS and (v) we show, through simulations and an actual deployment on a small testbed, how specific instantiations of parameters can lead to the algorithm achieving very efficient stabilisation.

Original languageEnglish
Pages (from-to)1789-1801
Number of pages13
JournalJournal of Parallel and Distributed Computing
Volume74
Issue number1
DOIs
Publication statusPublished - 2014

Keywords

  • Collision freedom
  • Correctness
  • Crashes
  • Data aggregation scheduling
  • Fault tolerance
  • Impossibility
  • Wireless sensor networks

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks'. Together they form a unique fingerprint.

Cite this