Low-latency routing for energy-harvesting sensor networks

  • Authors:
  • Hyuntaek Kwon;Donggeon Noh;Junu Kim;Joonho Lee;Dongeun Lee;Heonshik Shin

  • Affiliations:
  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea

  • Venue:
  • UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents low-latency routing strategies that take account of energy-harvesting sensor nodes in wireless sensor networks. Currently, in the case of tree-based network connectivity, 'lazy' nodes with a long interval between computational activities may slow down communication if deployed along a routing path. To cope with this problem, we suggest a random graph in which a node may have multiple parent nodes, thus allowing a choice of path to the sink node. We also propose three path selection schemes for the network topology on the basis of (a) the cost of a single hop from the current node, (b) the cost of two hops, and (c) the cost of a single hop plus a cost estimate for the remainder of the path to the sink, respectively. The proposed strategies are shown to outperform the existing routing algorithm for a tree-structured energy-harvesting sensor network.