KIT | KIT-Bibliothek | Impressum | Datenschutz

Priority List Sensor Scheduling using Optimal Pruning

Huber, Marco F.; Hanebeck, Uwe D.


State estimation and reconstruction quality of distributed phenomena that are monitored by a network of distributed sensors is strongly affected by communication failures, which is a problem in real-world sensor networks. In this paper, we propose a novel sensor scheduling approach named priority list sensor scheduling (PLSS). This approach facilitates efficient distributed estimation in sensor networks, even in case of unreliable communication, by prioritizing the sensor nodes according to local sensor schedules based on the predicted estimation error. It is shown that PLSS minimizes the expected estimation error for arbitrary packet-loss or transmission probabilities. As prioritizing sensor nodes requires the calculation of several sensor schedules, a novel pruning algorithm that preserves optimal schedules is also derived in order to significantly reduce the computational demand. This is accomplished by exploiting the monotonicity of the Riccati equation and the information contribution of individual sensor nodes in combination with a branch-and-bound technique.

Volltext §
DOI: 10.5445/IR/1000034860
DOI: 10.1109/ICIF.2008.4632231
Cover der Publikation
Zugehörige Institution(en) am KIT Fakultät für Informatik – Institut für Anthropomatik (IFA)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2008
Sprache Englisch
Identifikator ISBN: 978-3-8007-3092-6
KITopen-ID: 1000034860
Erschienen in Proceedings of the 11th International Conference on Information Fusion (Fusion 2008), Cologne, Germany, June 30 2008-July 3 2008
Verlag Institute of Electrical and Electronics Engineers (IEEE)
Seiten 1-8
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page