Gesellschaft für Informatik e.V.

Lecture Notes in Informatics


INFORMATIK 2007 Informatik trifft Logistik Band 2 Beiträge der 37. Jahrestagung der Gesellschaft für Informatik e.V. (GI) 24. - 27. September 2007 in Bremen P-110, 90-94 (2007).

Gesellschaft für Informatik, Bonn
2007


Editors

Otthein Herzog (ed.), Karl-Heinz Rödiger (ed.), Marc Ronthaler (ed.), Rainer Koschke (ed.)


Copyright © Gesellschaft für Informatik, Bonn

Contents

On sensor scheduling in case of unreliable communication

E. Stiegeler , U. D. Hanebeck and M. F. Huber

Abstract


This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. The sensor scheduling problem, where one sensor from a sensor network is selected for performing a measurement at a specific time instant so that the estimation errors are minimized, can be solved off-line by extensive tree search, in case an error-free communication is assumed. The main contribution of the proposed scheduling approach is to introduce a prioritization list for the sensors that leads to a minimization of the estimation error by selecting the most beneficial sensor even in case of unreliable communication. To lower the computational demand for the priority list calculation, an optimal pruning approach is introduced.


Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-206-1


Last changed 04.10.2013 18:14:52