Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System

In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The objective function to be minimized is the end-to-end processing delay, which is a crucialfactor in a number ofcontext- aware applications, e.g. mobile healthcare applications. The presented solution is a modification ofan earlier methodproposed by Bokhari, in which the optimal assignment problem to minimize the bottleneck processing time is transformed into a path-searching problem in a doubly weighted graph. Due to the incompatible requirements raised in our study, e.g. a-prior known location ofthe sensors, we propose a colouring scheme and a new search algorithm in this paper to obtain the optimal assignment in order to satisfy our objective. context). The processed results are sent to the mobile terminal to further calculate the probability of an epileptic seizure (higher level context). Ifa serious seizu...

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Hailiang Mei, Pravin Pawar, Ing Widya
• Keywords: Distributed And Parallel Computing, Healthcare Center, IPPS 2007, Mobile Terminal, Optimal Assignment