Please use this identifier to cite or link to this item: https://doi.org/10.1109/RTCSA.2007.33
Title: Critical-path based low-energy scheduling algorithms for body area network systems
Authors: Liu, Y.
Veeravalli, B. 
Viswanathan, S.
Issue Date: 2007
Source: Liu, Y., Veeravalli, B., Viswanathan, S. (2007). Critical-path based low-energy scheduling algorithms for body area network systems. Proceedings - 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2007 : 301-308. ScholarBank@NUS Repository. https://doi.org/10.1109/RTCSA.2007.33
Abstract: In this paper, we propose novel low-energy scheduling algorithms with low computational complexities for the heterogeneous Body Area Network (BAN) systems, considering task graphs with deadlines (timing constraints) and precedence relationships to satisfy. Our proposed novel scheme, referred to as "critical-path information track-and-update", analyses the critical-paths, identifies the slack and distributes it over tasks such that the overall energy consumption is minimised. Our dynamic scheduling algorithm utilises the results from the static scheduling algorithm and attempts to aggressively reduce the energy consumption. Simulations for the task graph for a typical BAN application show that our static and dynamic scheduling algorithms deliver 25% and 15% more energy savings respectively compared to typical slack reclamation based scheduling algorithms. © 2007 IEEE.
Source Title: Proceedings - 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2007
URI: http://scholarbank.nus.edu.sg/handle/10635/69764
ISBN: 0769529755
DOI: 10.1109/RTCSA.2007.33
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

13
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

1
checked on Nov 19, 2017

Page view(s)

27
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.