Exact and approximate balanced data gathering in energy-constrained sensor networks

  • Authors:
  • Patrik Floréen;Petteri Kaski;Jukka Kohonen;Pekka Orponen

  • Affiliations:
  • Helsinki Institute for Information Technology HIIT, Basic Research Unit, Department of Computer Science, University of Helsinki, Finland;Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland;Helsinki Institute for Information Technology HIIT, Basic Research Unit, Department of Computer Science, University of Helsinki, Finland;Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland

  • Venue:
  • Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of gathering data from a wireless multi-hop network of energy-constrained sensor nodes to a common base station. Specifically, we aim to balance the total amount of data received from the sensor network during its lifetime against a requirement of sufficient coverage for all the sensor locations surveyed. Our main contribution lies in formulating this balanced data gathering task, studying the effects of balancing, and proposing an approximation algorithm for the problem. Based on an LP network flow formulation, we present experimental results on both optimal and approximate data routing designs, in open transmission ranges and with impenetrable obstacles between the nodes.