KIT | KIT-Bibliothek | Impressum | Datenschutz

On Sensor Scheduling in Case of Unreliable Communication

Huber, Marco F. 1; Stiegeler, Eric 1; Hanebeck, Uwe D. 1
1 Universität Karlsruhe (TH)


This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an error-free communication, the sensor scheduling problem, where one sensor from a sensor network is selected for measuring at a specific time instant so that the estimation errors are minimized, can be solved off-line by extensive tree search. For the more realistic scenario, where communication is unreliable, a scheduling approach using a prioritization list for the sensors is proposed that leads to a minimization of the estimation error by selecting the most beneficial sensor on-line. To lower the computational demand for the priority list calculation, a novel optimal pruning approach is introduced.

Volltext §
DOI: 10.5445/IR/1000034828
Zitationen: 1
Cover der Publikation
Zugehörige Institution(en) am KIT Fakultät für Informatik – Institut für Anthropomatik (IFA)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2007
Sprache Englisch
Identifikator ISBN: 978-3-88579-204-8
ISSN: 1617-5468
KITopen-ID: 1000034828
Erschienen in INFORMATIK 2007 - the 37th Annual Conference of the Informatik 2007 : Informatik trifft Logistik; Beiträge der 37. Jahrestagung der Gesellschaft für Informatik e.V. (GI); 24. bis 27. September 2007 in Bremen. Bd. 2. Hrsg.: R. Koschke
Verlag Gesellschaft für Informatik (GI)
Seiten 90-94
Serie GI-Edition / Proceedings ; 110
Externe Relationen Abstract/Volltext
Nachgewiesen in Scopus
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page