Location-free object tracking on graph structures

Daniela Krüger; Carsten Buschmann; Stefan Fischer

doi:10.1007/978-3-540-88793-5_8

Location-free object tracking on graph structures

Daniela Krüger, Carsten Buschmann, Stefan Fischer

Institute of Telematics

Abstract

Using wireless sensor networks for object tracking requires ordering events with regard to time and location. In labyrinth-shaped topologies, one-dimensional ordering suffices within the different sections of the network. We present an algorithm that decomposes the network into such sections, tracks objects within using binary sensors and, if required, hands them over to the next section. We evaluate our approach through extensive simulations and show that it is robust against sensor failures and packet loss.

Original language	English
Title of host publication	EuroSSC 2008: Smart Sensing and Context
Number of pages	13
Volume	5279 LNCS
Place of Publication	Berlin, Heidelberg
Publisher	Springer Verlag
Publication date	08.12.2008
Pages	99-111
ISBN (Print)	978-3-540-88792-8
ISBN (Electronic)	978-3-540-88793-5
DOIs	https://doi.org/10.1007/978-3-540-88793-5_8
Publication status	Published - 08.12.2008
Event	3rd European Conference on Smart Sensing and Context - Zurich, Switzerland Duration: 29.10.2008 → 31.10.2008 Conference number: 74363

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-3-540-88793-5_8

Cite this

@inproceedings{49fd1d34f0864d31b072109bd351775b,

title = "Location-free object tracking on graph structures",

abstract = "Using wireless sensor networks for object tracking requires ordering events with regard to time and location. In labyrinth-shaped topologies, one-dimensional ordering suffices within the different sections of the network. We present an algorithm that decomposes the network into such sections, tracks objects within using binary sensors and, if required, hands them over to the next section. We evaluate our approach through extensive simulations and show that it is robust against sensor failures and packet loss.",

author = "Daniela Kr{\"u}ger and Carsten Buschmann and Stefan Fischer",

year = "2008",

month = dec,

day = "8",

doi = "10.1007/978-3-540-88793-5_8",

language = "English",

isbn = "978-3-540-88792-8",

volume = "5279 LNCS",

series = "Lecture Notes in Computer Science ",

publisher = "Springer Verlag",

pages = "99--111",

booktitle = "EuroSSC 2008: Smart Sensing and Context",

note = "3rd European Conference on Smart Sensing and Context , EuroSSC 2008 ; Conference date: 29-10-2008 Through 31-10-2008",

}

Krüger, D, Buschmann, C & Fischer, S 2008, Location-free object tracking on graph structures. in EuroSSC 2008: Smart Sensing and Context . vol. 5279 LNCS, Lecture Notes in Computer Science , vol. 5279 LNCS, Springer Verlag, Berlin, Heidelberg, pp. 99-111, 3rd European Conference on Smart Sensing and Context , Zurich, Switzerland, 29.10.08. https://doi.org/10.1007/978-3-540-88793-5_8

Location-free object tracking on graph structures. / Krüger, Daniela; Buschmann, Carsten; Fischer, Stefan.
EuroSSC 2008: Smart Sensing and Context . Vol. 5279 LNCS Berlin, Heidelberg: Springer Verlag, 2008. p. 99-111 (Lecture Notes in Computer Science ; Vol. 5279 LNCS).

Research output: Chapters in Books/Reports/Conference Proceedings › Conference contribution › peer-review

TY - GEN

T1 - Location-free object tracking on graph structures

AU - Krüger, Daniela

AU - Buschmann, Carsten

AU - Fischer, Stefan

N1 - Conference code: 74363

PY - 2008/12/8

Y1 - 2008/12/8

N2 - Using wireless sensor networks for object tracking requires ordering events with regard to time and location. In labyrinth-shaped topologies, one-dimensional ordering suffices within the different sections of the network. We present an algorithm that decomposes the network into such sections, tracks objects within using binary sensors and, if required, hands them over to the next section. We evaluate our approach through extensive simulations and show that it is robust against sensor failures and packet loss.

AB - Using wireless sensor networks for object tracking requires ordering events with regard to time and location. In labyrinth-shaped topologies, one-dimensional ordering suffices within the different sections of the network. We present an algorithm that decomposes the network into such sections, tracks objects within using binary sensors and, if required, hands them over to the next section. We evaluate our approach through extensive simulations and show that it is robust against sensor failures and packet loss.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-57049173103&origin=inward&txGid=5a9665d0423c5cfa0fe67238a36080af

U2 - 10.1007/978-3-540-88793-5_8

DO - 10.1007/978-3-540-88793-5_8

M3 - Conference contribution

SN - 978-3-540-88792-8

VL - 5279 LNCS

T3 - Lecture Notes in Computer Science

SP - 99

EP - 111

BT - EuroSSC 2008: Smart Sensing and Context

PB - Springer Verlag

CY - Berlin, Heidelberg

T2 - 3rd European Conference on Smart Sensing and Context

Y2 - 29 October 2008 through 31 October 2008

ER -

Location-free object tracking on graph structures

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this