|Pizzocaro, Diego, Johnson, M., Rowaihy, H., Chalmers, S., Preece, Alun David, Bar-Noy, A. and La Porta, T. F. 2008. Maximizing utility of sensor-mission assignment with uncertain demands. Presented at: 2nd Annual Conference of the International Technology Alliance (ACITA) 2008, London, UK, 16-18 September 2008.|
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Schools:||Computer Science & Informatics|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Last Modified:||15 Nov 2013 09:55|
Cited 1 time in Google Scholar. View in Google Scholar
Actions (repository staff only)