Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

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

Tools
- Tools
+ Tools

Jhumka, Arshad, Bradbury, Matthew S. and Saginbekov, Sain (2014) Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks. Journal of Parallel and Distributed Computing, Volume 74 (Number 1). pp. 1789-1801. doi:10.1016/j.jpdc.2013.09.011

[img]
Preview
PDF
WRAP_0921660-cs-271114-jpdc-jbs-das-ft.pdf - Accepted Version - Requires a PDF viewer.

Download (653Kb) | Preview
Official URL: http://dx.doi.org/10.1016/j.jpdc.2013.09.011

Request Changes to record.

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
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Wireless sensor networks, Fault-tolerant computing, Computer systems failures
Journal or Publication Title: Journal of Parallel and Distributed Computing
Publisher: Elsevier Science BV
ISSN: 0743-7315
Official Date: January 2014
Dates:
DateEvent
January 2014Published
11 October 2013Available
24 September 2013Accepted
22 July 2013Modified
7 February 2013Submitted
Volume: Volume 74
Number: Number 1
Number of Pages: 27
Page Range: pp. 1789-1801
DOI: 10.1016/j.jpdc.2013.09.011
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: University of Warwick
Version or Related Resource: Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks. Published in: Proceedings 2010 29th IEEE International Symposium on Reliable Distributed Systems. Los Alamitos, California : IEEE, 2010.
Embodied As: 1
Related URLs:
  • http://dx.doi.org/10.1109/SRDS.2010.14

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us