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

Jhumka, Arshad and Bradbury, Matthew and Saginbekov, Sain (2014) Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks. Journal of Parallel and Distributed Computing, 74 (1). pp. 1789-1801. ISSN 0743-7315

Full text not available from this repository.

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.

Item Type:
Journal Article
Journal or Publication Title:
Journal of Parallel and Distributed Computing
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1705
Subjects:
ID Code:
154167
Deposited By:
Deposited On:
26 Apr 2021 10:35
Refereed?:
Yes
Published?:
Published
Last Modified:
19 Nov 2021 11:32