Constructing maximum-lifetime data gathering forests in sensor networks

  • Authors:

  • Yan Wu;Zhoujia Mao;Sonia Fahmy;Ness B. Shroff

  • Affiliations:

  • Microsoft Corporation, Seattle, WA;Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH;Department of Computer Science, Purdue University, West Lafayette, IN;Departments of Electrical and Computer Engineering and Computer Science and Engineering, The Ohio State University, Columbus, OH

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For applications where each sensor continuously monitors the environment and periodically reports to a base station, a tree-based topology is often used to collect data from sensor nodes. In this work, we first study the construction of a data-gathering tree when there is a single base station in the network. The objective is to maximize the network lifetime, which is defined as the time until the first node depletes its energy. The problem is shown to be NP-complete. We design an algorithm that starts from an arbitrary tree and iteratively reduces the load on bottleneck nodes (nodes likely to soon deplete their energy due to high degree or low remaining energy). We then extend our work to the case when there are multiple base stations and study the construction of a maximum-lifetime data-gathering forest. We show that both the tree and forest construction algorithms terminate in polynomial time and are provably near optimal. We then verify the efficacy of our algorithms via numerical comparisons.