Energy and delay are critical issues for wireless sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Due to the uncertainties in execution time of some tasks, this paper models each varied execution time as a probabilistic random variable and incorporating applications' performance requirements to solve the MAP (Mode Assignment with Probability) problem. Using probabilistic design, we propose an optimal algorithm 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. For example, our algorithm achieves an average improvement of 32.6% on total energy consumption. © IFIP International Federation for Information Processing 2006.
CITATION STYLE
Qiu, M., Xue, C., Shao, Z., Zhuge, Q., Liu, M., & Sha, E. H. M. (2006). Efficent algorithm of energy minimization for heterogeneous wireless sensor network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4096 LNCS, pp. 25–34). Springer Verlag. https://doi.org/10.1007/11802167_5
Mendeley helps you to discover research relevant for your work.