Sensor scheduling for multiple parameters estimation under energy constraint

Authors:
Yi Wang;Mingyan Liu;Demosthenis Teneketzis
Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 4
Cited 0

Stochastic systems: estimation, identification and adaptive control

Stochastic systems: estimation, identification and adaptive control
ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES

Probability in the Engineering and Informational Sciences
Entropy-based sensor selection heuristic for target localization

Proceedings of the 3rd international symposium on Information processing in sensor networks
The sensor selection problem for bounded uncertainty sensing models

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a sensor scheduling problem for estimating Gaussian random variables under an energy constraint. The sensors are described by a linear observation model, and the observation noise is Gaussian. We formulate this problem as a stochastic sequential decision problem. Due to the Gaussian assumption and the linear observation model, the stochastic sequential decision problem is equivalent to a deterministic one. We present a greedy algorithm for this problem, and discover conditions sufficient to guarantee the optimality of the greedy algorithm. Furthermore, we present two special cases of the original scheduling problem where the greedy algorithm is optimal under weaker conditions. We illustrate our result through numerical examples.