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

Research

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks. / Jhumka, Arshad; Bradbury, Matthew; Saginbekov, Sain.
In: Journal of Parallel and Distributed Computing, Vol. 74, No. 1, 31.01.2014, p. 1789-1801.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Jhumka, A, Bradbury, M & Saginbekov, S 2014, 'Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks', Journal of Parallel and Distributed Computing, vol. 74, no. 1, pp. 1789-1801. https://doi.org/10.1016/j.jpdc.2013.09.011

APA

Jhumka, A., Bradbury, M., & Saginbekov, S. (2014). Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks. Journal of Parallel and Distributed Computing, 74(1), 1789-1801. https://doi.org/10.1016/j.jpdc.2013.09.011

Vancouver

Jhumka A, Bradbury M, Saginbekov S. Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks. Journal of Parallel and Distributed Computing. 2014 Jan 31;74(1):1789-1801. Epub 2013 Oct 11. doi: 10.1016/j.jpdc.2013.09.011

Author

Jhumka, Arshad ; Bradbury, Matthew ; Saginbekov, Sain. / Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks. In: Journal of Parallel and Distributed Computing. 2014 ; Vol. 74, No. 1. pp. 1789-1801.

Bibtex

@article{a99f654f3d3747e7bd0f2c79e70fdf25,
title = "Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks",
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.",
keywords = "Wireless sensor networks, Data aggregation scheduling, Fault tolerance, Crashes, Collision freedom, Impossibility, Correctness",
author = "Arshad Jhumka and Matthew Bradbury and Sain Saginbekov",
year = "2014",
month = jan,
day = "31",
doi = "10.1016/j.jpdc.2013.09.011",
language = "English",
volume = "74",
pages = "1789--1801",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "1",

}

RIS

TY - JOUR

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

AU - Jhumka, Arshad

AU - Bradbury, Matthew

AU - Saginbekov, Sain

PY - 2014/1/31

Y1 - 2014/1/31

N2 - 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.

AB - 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.

KW - Wireless sensor networks

KW - Data aggregation scheduling

KW - Fault tolerance

KW - Crashes

KW - Collision freedom

KW - Impossibility

KW - Correctness

U2 - 10.1016/j.jpdc.2013.09.011

DO - 10.1016/j.jpdc.2013.09.011

M3 - Journal article

VL - 74

SP - 1789

EP - 1801

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 1

ER -