Energy efficient joint data aggregation and link scheduling in solar sensor networks

  • Authors:

  • Jianhui Zhang;Xingfa Shen;Shaojie Tang;Guojun Dai

  • Affiliations:

  • Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou 310018, China and SITE, University of Ottawa, Ottawa, Canada K1N 6N5;Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou 310018, China;Illinois Institute of Technology, Chicago, IL 60616, USA;Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou 310018, China

  • Venue:
  • Computer Communications
  • Year:
  • 2011

Quantified Score

Hi-index 0.24

Visualization

Abstract

Solar sensor nodes equipped with micro-solar subsystems [1] provide a novel approach to harvest ambient energy, which partially alleviated the energy-limitation in traditional wireless sensor networks. However, it also poses new challenges that the amounts of energy harvested by nodes are dynamic and unbalanced among them thus network life cannot be necessarily prolonged if no well-designed energy-scheduling is adopted. Herein, we present an algorithm to construct Energy-efficient Data Aggregation Tree (EDAT) based on a Maximum-Weighted Connected Dominating Set (MaCDS). The EDAT aims to prolong network life by minimizing differences in energy consumption among sensor nodes. Here we assume that the amount of harvested energy H randomly and uniformly distributes in the interval [H"m"i"n,H"m"a"x], where H"m"a"x and H"m"i"n are respectively the maximum and the minimum of H. The total energy consumption difference of an EDAT is at most 5H~|S|^2n-1, where H~=|[H"m"i"n,H"m"a"x]|, and S is the dominating set and n the total number of nodes. Furthermore, we designed a link-scheduling algorithm to minimize the number of time slots necessary for scheduling all links in the whole network based on EDAT. The number of time slots is bounded in the interval [4@d-1,2l"k@r^2], where l"k is determined by hops k,@r=max@D,H"m"a"xH"m"i"n, and @d and @D are respectively the minimal and maximal degree of the network. We found the most efficient work period is not determined by the node with the minimum harvested energy but by the one with the minimum Hd, where d is the node's degree in the EDAT. We determine the necessary condition required for every node to have sufficient energy to support consecutive operation.