Home > Research > Publications & Outputs > Efficient fault-tolerant collision-free data ag...

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
Close
<mark>Journal publication date</mark>31/01/2014
<mark>Journal</mark>Journal of Parallel and Distributed Computing
Issue number1
Volume74
Number of pages13
Pages (from-to)1789-1801
Publication StatusPublished
Early online date11/10/13
<mark>Original language</mark>English

Abstract

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.