Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health


Share/Save/Bookmark

Mei, Hailiang and Widya, Ing (2007) Context-Aware Optimal Assignment of a Chain-like Processing Task onto Chain-like Resources in M-Health. In: International Conference on Computational Science, ICCS, 27-30 May 2007, Beijing, China.

[img]PDF
Restricted to UT campus only
: Request a copy
239Kb
Abstract:This paper focuses on the optimal assignment of a chain-structured medical task onto a chain of networked devices, a need identified in context-aware mobile healthcare applications. We propose a graph-based method to compute the assignment which has the minimal end-to-end process and transfer delay. In essence, the method transforms the assignment problem to a shortest path problem in a graph representing all possible assignments. Compared to earlier work, our method relaxes a so-called contiguity constraint, which is a necessity in the earlier case but unnecessarily constraining in the healthcare applications. The proposed method reduces the time and space complexity in case it is adapted to include the contiguity constraint.
Item Type:Conference or Workshop Item
Copyright:© 2007 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62083
Official URL:http://dx.doi.org/10.1007/978-3-540-72588-6_69
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 245895