By Topic

Critical-Path based Low-Energy Scheduling Algorithms for Body Area Network Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yanhong Liu ; Nat. Univ. of Singapore, Singapore ; Veeravalli, B. ; Viswanathan, S.

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.

Published in:

Embedded and Real-Time Computing Systems and Applications, 2007. RTCSA 2007. 13th IEEE International Conference on

Date of Conference:

21-24 Aug. 2007