In this paper, we study run-time adaptation methods of a schedule of sensor activity generated for ideal temperature conditions. Such a schedule cannot be completed in low-temperature conditions due to a shorter lifetime of sensor batteries. We proposed several methods of selecting the next slot to be executed when the currently scheduled slot is unfeasible. Our experiments showed that in most cases, the best method is the one selecting the next slot based on computing the mean and standard deviation values of the battery load level for all the sensors active in a given slot.
CITATION STYLE
Trojanowski, K., Mikitiuk, A., & Grzeszczak, J. A. (2020). Run-Time Schedule Adaptation Methods for Sensor Networks Coverage Problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12133 LNCS, pp. 461–471). Springer. https://doi.org/10.1007/978-3-030-47679-3_39
Mendeley helps you to discover research relevant for your work.