Maximizing Utility of Sensor-Mission Assignment with Uncertain Demands
Authors
Diego Pizzocaro, Matthew P. Johnsony, Hosam Rowaihy, Stuart Chalmersx, Alun Preece, Amotz Bar-Noyy, and Thomas La Porta
Abstract
A sensor network is usually required to support multiple missions to be accomplished simultaneously. Since missions might compete for the exclusive usage of the same sensing resource we need to assign individual sensors to missions. Missions are characterized by an uncertain demand for sensing resource capabilities. We model this assignment problem by introducing the Sensor Utility Maximization (SUM) model. SUM is NP-Complete and is a special case of the well known Generalized Assignment Problem (GAP). We compare a pre-existing algorithm developed for GAP with a new greedy algorithm which offers the best trade-off between quality of solution and computation cost.
Publication Date
June, 2008
Venue
DCOSS 2008
Published To
Conference
Publication Type
Externally published
ITA Area
Project 8, Technical area 3
Download a copy of the paper here
PizzocaroDCOSSposter.pdf
PizzocaroDCOSSrevised_0.pdf
Return to main page