Energy-aware online algorithm to satisfy sampling rates with guaranteed probability for sensor applications

10Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Energy consumption is a major factor that limits the performance of sensor applications. Sensor nodes have varying sampling rates since they face continuously changing environments. In this paper, the sampling rate is modeled as a random variable, which is estimated over a finite time window. We presents an online algorithm to minimize the total energy consumption while satisfying sampling rate with guaranteed probability. An efficient algorithm, EOSP (Energy-aware Online algorithm to satisfy Sampling rates with guaranteed Probability), is proposed. Our approach can adapt the architecture accordingly to save energy. Experimental results demonstrate the effectiveness of our approach. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Qiu, M., & Sha, E. H. M. (2007). Energy-aware online algorithm to satisfy sampling rates with guaranteed probability for sensor applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4782 LNCS, pp. 156–167). Springer Verlag. https://doi.org/10.1007/978-3-540-75444-2_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free