Distributed coverage games for mobile visual sensor networks

Details Distributed coverage games for mobile visual sensor networks Distributed coverage games for mobile visual sensor networks

2010-02-01

arxiv.org/abs/1002.0367v1

Mathematics

Optimization and Control

20 pages, 2 figures

Scientific paper

Motivated by current challenges in data-intensive sensor networks, we formulate a coverage optimization problem for mobile visual sensors as a (constrained) repeated multi-player game. Each visual sensor tries to optimize its own coverage while minimizing the processing cost. We present two distributed learning algorithms where each sensor only remembers its own utility values and actions played during the last plays. These algorithms are proven to be convergent in probability to the set of (constrained) Nash equilibria and global optima of certain coverage performance metric, respectively.

Affiliated with

Also associated with

No associations

Rating

Distributed coverage games for mobile visual sensor networks 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 Distributed coverage games for mobile visual sensor networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed coverage games for mobile visual sensor networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706214