Please use this identifier to cite or link to this item:
|Title:||An energy-balanced task scheduling heuristic for heterogeneous wireless sensor networks||Authors:||Goh, L.K.
|Keywords:||Dynamic voltage scaling
Heterogeneous multiprocessor scheduling
Wireless sensor network
|Issue Date:||2008||Citation:||Goh, L.K.,Veeravalli, B. (2008). An energy-balanced task scheduling heuristic for heterogeneous wireless sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5374 LNCS : 257-268. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-89894-8_25||Abstract:||In this paper, we propose a static scheduling algorithm for assigning tasks with precedence constraints onto a cluster of heterogeneous sensor nodes connected by a single-hop wireless network so as to maximize the lifetime of the sensor network. The processing element on each sensor node is equipped with dynamic voltage scaling capability. In our algorithm, we assign the tasks to the sensor nodes so as to minimize the energy consumption of the tasks on each sensor node while keeping the energy consumption as balanced as possible. We also propose an algorithm to generate a second schedule that can improve the lifetime of the network further when it is used together with the original schedule. We observe up to 311% lifetime improvement in our simulations when our algorithms are compared to the baseline case where dynamic voltage scaling is not used. © 2008 Springer Berlin Heidelberg.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/69315||ISBN:||354089893X||ISSN:||03029743||DOI:||10.1007/978-3-540-89894-8_25|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 27, 2022
checked on Sep 22, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.