Logo des Repositoriums
 

On Sensor Scheduling in Case of Unreliable Communication

dc.contributor.authorHuber, Marco F.
dc.contributor.authorStiegeler, Eric
dc.contributor.authorHanebeck, Uwe D.
dc.contributor.editorHerzog, Otthein
dc.contributor.editorRödiger, Karl-Heinz
dc.contributor.editorRonthaler, Marc
dc.contributor.editorKoschke, Rainer
dc.date.accessioned2019-05-15T09:04:47Z
dc.date.available2019-05-15T09:04:47Z
dc.date.issued2007
dc.description.abstractThis 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.en
dc.identifier.isbn978-3-88579-206-1
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/22457
dc.language.isoen
dc.publisherGesellschaft für Informatik e. V.
dc.relation.ispartofInformatik 2007 – Informatik trifft Logistik – Band 2
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-110
dc.titleOn Sensor Scheduling in Case of Unreliable Communicationen
dc.typeText/Conference Paper
gi.citation.endPage94
gi.citation.publisherPlaceBonn
gi.citation.startPage90
gi.conference.date24.-27. September 2007
gi.conference.locationBremen
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
90.pdf
Größe:
173.68 KB
Format:
Adobe Portable Document Format