Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
| Paper: | SS-4.1 |
| Session: | Signal Processing for Wireless Sensor Networks I |
| Time: | Wednesday, May 19, 09:30 - 09:50 |
| Presentation: |
Special Session Lecture |
| Topic: |
Special Sessions: Signal Processing for Wireless Sensor Networks |
| Title: |
SENSOR SCHEDULING ALGORITHMS REQUIRING LIMITED COMPUTATION |
| Authors: |
Vijay Gupta; California Institute of Technology | | |
| | Timothy Chung; California Institute of Technology | | |
| | Babak Hassibi; California Institute of Technology | | |
| | Richard M Murray; California Institute of Technology | | |
| Abstract: |
In this paper, we consider the scenario where many sensors co-operate to estimate a process. Only one sensor can take a measurement at any time step. We wish to come up with optimal sensor scheduling algorithms. The problem is motivated by the use of sonar range-finders used by the vehicles on the Caltech Multi-Vehicle Wireless Testbed. 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. |
| |
| Back | |