Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Frugal Sensor Assignment

Johnson, Matthew P., Rowaihy, Hosam, Pizzocaro, Diego, Bar-Noy, Amotz, Chalmers, Stuart, Porta, Thomas and Preece, Alun David 2008. Frugal Sensor Assignment. Lecture Notes in Computer Science 5067 , pp. 219-236. 10.1007/978-3-540-69170-9_15

Full text not available from this repository.

Abstract

When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In general, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In the dynamic setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help based on the value of the mission, the sensor’s remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Springer Verlag
ISSN: 0302-9743
Last Modified: 15 Nov 2013 09:41
URI: http://orca.cf.ac.uk/id/eprint/14256

Citation Data

Cited 35 times in Google Scholar. View in Google Scholar

Cited 16 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item