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 April 2005 | Submitted + Published
Book Section - Chapter Open

Scheduling for Distributed Sensor Networks with Single Sensor Measurement per Time Step

Abstract

We examine the problem of distributed estimation when only one sensor can take a measurement per time step. We solve for the optimal recursive estimation algorithm when the sensor switching schedule is given. We then consider the effect of noise in communication channels. We also investigate the problem of determining an optimal sensor switching strategy. We see that this problem involves searching a tree in general and propose two strategies for pruning the tree to minimize the computation. The first is a sliding window strategy motivated by the Viterbi algorithm, and the second one uses thresholding. The performance of the algorithms is illustrated using numerical examples.

Additional Information

© 2004 IEEE. 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

Published - 01307149.pdf

Submitted - Scheduling_for_Distributed_Sensor_Networks_with_Single_Sensor_Measurement_per_Time_Step..pdf

Files

Scheduling_for_Distributed_Sensor_Networks_with_Single_Sensor_Measurement_per_Time_Step..pdf
Files (516.4 kB)

Additional details

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