Adaptive online energy saving for heterogeneous sensor networks

  • Meikang Qiu*
  • , Jingtong Hu
  • , Edwin H.M. Sha
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Sensor nodes usually work under dynamic changing, hard-to-predict environments and have limited lifetime. We use a novel adaptive online energy saving (AOES) algorithm to save total energy consumption for heterogeneous sensor networks. Due to the uncertainties in execution time of some tasks and multiple working mode of each node, this paper models each varied execution time as a probabilistic random variable to save energy by selecting the best mode assignment for each node, which is called Mode Assignment with Probability (MAP) problem. We propose an optimal sub-algorithm MAP-Opt to minimize the total energy consumption while satisfying the timing constraint with a guaranteed confidence probability. The experimental results show that our approach achieves significant energy saving than previous work.

Original languageEnglish
Title of host publicationProceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Pages294-299
Number of pages6
StatePublished - 2007
Externally publishedYes
Event19th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: 19 Nov 200721 Nov 2007

Publication series

NameProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
ISSN (Print)1027-2658

Conference

Conference19th IASTED International Conference on Parallel and Distributed Computing and Systems
Country/TerritoryUnited States
CityCambridge, MA
Period19/11/0721/11/07

Keywords

  • Adaptive
  • Assignment
  • Heterogeneous
  • Online
  • Sensor

Fingerprint

Dive into the research topics of 'Adaptive online energy saving for heterogeneous sensor networks'. Together they form a unique fingerprint.

Cite this