Sensor-Mission Matching: Centralized and Distributed Approaches
Authors
Hosam Rowaihy, Matthew Johnson, Theodore Brown, Amotz Bar-Noy, Thomas La Porta
Abstract
A sensor network consists of a large number of small sensing devices that are able to collect information about their surroundings. When such a network is deployed in a field it is usually required to support multiple missions. Hence, schemes that match sensors to missions become necessary. In this paper, we formally define the sensor-mission matching problem and examine two approaches to solve it.We first consider a centralized approach in which the decisions on which sensors are selected and assigned to missions are made in a single node. We propose two centralized schemes: mission-side greedy and sensor-side greedy. The second approach we consider is distributed, with the decisions made by multiple nodes. We propose two schemes that fall under this approach: a bidding-based scheme and a multi-round proposal scheme. We also show simulation results comparing the performance of these solutions.
Publication Date
September, 2007
Venue
Annual Conference of ITA, 2007
Published To
None
Paper Signficance
This paper has been highlighted as an excellent example of a US/UK collaborative paper
Publication Type
ITA Conference paper
ITA Area
Project 8, Technical area 3
Download a copy of the paper here
matching_0.pdf
Return to main page