Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 12, 2015 | Submitted
Report Open

Scheduling for Distributed Sensor Networks

Abstract

We examine the problem of distributed estimation when only one sensor can take a measurement per time step. The measurements are then exchanged among the sensors. The problem is motivated by the use of sonar range-finders used by the vehicles on the Caltech Multi-Vehicle Wireless Testbed. We solve for the optimal recursive estimation algorithm when the sensor switching schedule is given. Then we investigate several approaches for determining an optimal sensor switching strategy. We see that this problem involves searching a tree in general and propose and analyze two strategies for pruning the tree to keep the computation limited. The first is a sliding window strategy motivated by the Viterbi algorithm, and the second one uses thresholding. We also study a technique that employs choosing the sensors randomly from a probability distribution which can then be optimized. The performance of the algorithms are illustrated with the help of numerical examples.

Additional Information

The authors would like to thank Joel Burdick for helpful discussions. Research supported in part by the AFOSR grant F49620-01-1-0460 for the first author and by the Engineering Research Centers Program of the National Science Foundation under Award Number EEC-9402726 and also a grant from NASA for the second author.

Attached Files

Submitted - _Schedu_ling_for_Distributed_Sensor_Networks.pdf

Files

_Schedu_ling_for_Distributed_Sensor_Networks.pdf
Files (508.1 kB)
Name Size Download all
md5:533037bd5b0aeb697903cb65b8002d2a
508.1 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
March 5, 2024