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

TitleEfficient Allocation of Hierarchically-Decomposable Tasks in a Sensor Web Contract Net
Publication TypeConference Paper
Year of Publication2009
AuthorsKinnebrew, J. S., and G. Biswas
Refereed DesignationRefereed
Conference NameThe IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (IAT)
Date Published09/2009
PublisherIEEE Computer Society
Conference LocationMilan, Italy
ISBN Number978-0-7695-3801-3

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. This paper presents a novel variation of the contract net protocol (CNP) for subtask allocation, which employs brokers to limit communication overhead in a two-phase CNP and aggregate domain information from groups of agents. Experimental results using this subtask allocation approach verify its efficiency and scalability. These results also suggest specific refinements and appropriate parameters for a variety of system configurations and operating conditions in sensor webs and other large multi-agent systems.

Kinnebrew & Biswas - 2009 - IAT -- Efficient Alloc Hierarch-Decomp Tasks in Sensor Web CNet.pdf1.55 MB