|Efficient Allocation of Hierarchically-Decomposable Tasks in a Sensor Web Contract Net|
In large, distributed systems, such as a sensor web, allocating resources to tasks that span multiple providers presents significant challenges. Individual subtasks associated with a task could potentially be assigned to a number of agents (e.g., when there is overlap in sensor or data processing capability among constituent sensor networks). This problem is further compounded by the dynamic nature of a sensor web, in which both desired tasks and resource availability change with time and environmental conditions.
|Year of Publication||
The IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (IAT)
IEEE Computer Society
|Google Scholar | BibTeX | XML|