Efficient Allocation of Hierarchically-Decomposable Tasks in a Sensor Web Contract Net
Author
Abstract

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
2009
Conference Name
The IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (IAT)
Date Published
09/2009
Publisher
IEEE Computer Society
Conference Location
Milan, Italy
ISBN Number
978-0-7695-3801-3
Attachments
Google Scholar | BibTeX | XML