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

Abstract

Abstract. This paper focuses on the optimal assignment of a chain-structured medical task onto a chain of networked devices, a need identified in contextaware 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.

Enhancing the performance of mobile healthcare systems based on task-redistribution

“…branch and bound [10], A* [9] and graph partitioning [13]. In special cases, we have proposed polynomial-time algorithms for chain to chain assignment [14] and tree to star assignment [15] inspired by previous work [16]. We present the models to estimate system QoS performance based on the assumed known characteristics of individual task (Table 1) given a particular assignment.…”

Smart Distribution of Bio-signal Processing Tasks in M-Health

“…However, some cases with special topological feature might have more efficient solutions. We have proposed polynomial-time algorithms for chain to chain assignment [14] and tree to star assignment [15] inspired by previous work [16].…”

“…Another important discovery was led by Bokhari [16], in which several models with special topology are studied and graph-based efficient algorithms are proposed. Several improved algorithms on these topologies were further reported in [14,[25][26][27].…”