An efficient algorithm for constructing maximum lifetime tree for data gathering without aggregation in wireless sensor networks

  • Authors:

  • Junbin Liang;Jianxin Wang;Jiannong Cao;Jianer Chen;Mingming Lu

  • Affiliations:

  • School of Information Science and Engineering, Central South University, Changsha, China and School of Computer and Electronic Information, Guangxi University, Nanning, China;School of Information Science and Engineering, Central South University, Changsha, China;Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China;School of Information Science and Engineering, Central South University, Changsha, China and Department of Computer Science, Texas A&M University, College Station, Texas;School of Information Science and Engineering, Central South University, Changsha, China

  • Venue:
  • INFOCOM'10 Proceedings of the 29th conference on Information communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data gathering is a broad research area in wireless sensor networks. The basic operation in sensor networks is the systematic gathering and transmission of sensed data to a sink for further processing. The lifetime of the network is defined as the time until the first node depletes its energy. A key challenge in data gathering without aggregation is to conserve the energy consumption among nodes so as to maximize the network lifetime. We formalize the problem of tackling the challenge as to construct a min-max-weight spanning tree, in which the bottleneck nodes have the least number of descendants according to their energy. However, the problem is NP-complete. A Ω(log n/log log n)- approximation algorithm MITT is proposed to solve the problem without location information. Simulation results show that MITT can achieve longer network lifetime than existing algorithms.