@Article{Jhumka:2014:Efficientfaulttolerant,
    author = "Jhumka, Arshad and Bradbury, Matthew and Saginbekov, Sain",
    journal = "Journal of Parallel and Distributed Computing",
    title = "Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks",
    year = "2014",
    issn = "0743-7315",
    month = "January",
    number = "1",
    pages = "1789--1801",
    volume = "74",
    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.",
    doi = "10.1016/j.jpdc.2013.09.011",
    file = ":JPDC2014.pdf:PDF",
    keywords = "Wireless sensor networks"
}