Latency-constrained aggregation in sensor networks

  • Authors:

  • LUCA Becchetti;Alberto Marchetti-Spaccamela;Andrea Vitaletti;Peter Korteweg;Martin Skutella;Leen Stougie

  • Affiliations:

  • Sapienza University of Rome, Italy;Sapienza University of Rome, Italy;Sapienza University of Rome, Italy;TU Eindhoven, The Netherlands;TU Berlin, Germany;VU University, and CWI Amsterdam, The Netherlands

  • Venue:
  • ACM Transactions on Algorithms (TALG)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A sensor network consists of sensing devices which may exchange data through wireless communication; sensor networks are highly energy constrained since they are usually battery operated. Data aggregation is a possible way to save energy consumption: nodes may delay data in order to aggregate them into a single packet before forwarding them towards some central node (sink). However, many applications impose constraints on the maximum delay of data; this translates into latency constraints for data arriving at the sink. We study the problem of data aggregation to minimize maximum energy consumption under latency constraints on sensed data delivery, and we assume unique communication paths that form an intree rooted at the sink. We prove that the offline problem is strongly NP-hard and we design a 2-approximation algorithm. The latter uses a novel rounding technique. Almost all real-life sensor networks are managed online by simple distributed algorithms in the nodes. In this context we consider both the case in which sensor nodes are synchronized or not. We assess the performance of the algorithm by competitive analysis. We also provide lower bounds for the models we consider, in some cases showing optimality of the algorithms we propose. Most of our results also hold when minimizing the total energy consumption of all nodes.