Approaching the upper limit of lifetime for data gathering sensor networks

  • Authors:
  • Haibin Yu;Peng Zeng;Wei Liang

  • Affiliations:
  • Shenyang, Institute of Automation Chinese Academy of Sciences Shenyang, Liaoning, P.R.China;Shenyang, Institute of Automation Chinese Academy of Sciences Shenyang, Liaoning, P.R.China;Shenyang, Institute of Automation Chinese Academy of Sciences Shenyang, Liaoning, P.R.China

  • Venue:
  • ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data gathering is a broad research area in wireless sensor network. In this paper, we consider the problem of routing between the base station and remote data sources via intermediate sensor nodes in a homogeneous sensor network. Sensor nodes have limited and unreplenishable power resources, both path energy cost and path length are important metrics affecting sensor lifetime. In this paper, we first explore the fundamental limits of sensor network lifetime that all algorithms can possibly achieve. Different from previous work, we explicitly consider the constraints of the limited energy and the limited end-to-end latency. We then model the formation of length and energy constrained paths and define the new composite metrics for energy-latency-optimal routing. We also design a distributed data gathering protocol called ELAG (Energy and Latency Aware data Gathering). This protocol balances energy consumption across the network by periodically determining a new optimal path consistent with associated energy distributions. Simulation results testify to the effectiveness of the protocol in producing a longer network lifetime.