Computer Science – Learning
Scientific paper
2010-02-09
Computer Science
Learning
Scientific paper
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to constraints (e.g., on power and bandwidth). In many applications the utility function is not known a priori, must be learned from data, and can even change over time. Furthermore for large sensor networks solving a centralized optimization problem to select sensors is not feasible, and thus we seek a fully distributed solution. In this paper, we present Distributed Online Greedy (DOG), an efficient, distributed algorithm for repeatedly selecting sensors online, only receiving feedback about the utility of the selected sensors. We prove very strong theoretical no-regret guarantees that apply whenever the (unknown) utility function satisfies a natural diminishing returns property called submodularity. Our algorithm has extremely low communication requirements, and scales well to large sensor deployments. We extend DOG to allow observation-dependent sensor selection. We empirically demonstrate the effectiveness of our algorithm on several real-world sensing tasks.
Faulkner Matthew
Golovin Daniel
Krause Andreas
No associations
LandOfFree
Online Distributed Sensor Selection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Online Distributed Sensor Selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Distributed Sensor Selection will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-124281