Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs

Fekete, Sándor; Kröller, Alexander; Buschmann, Carsten; Fischer, Stefan

doi:10.4230/DagSemProc.06481.2

Document

Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs

Authors Sándor Fekete, Alexander Kröller, Carsten Buschmann, Stefan Fischer

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 6481
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2007-06-01

PDF

File

PDF

DagSemProc.06481.2.pdf

Filesize: 103 kB
2 pages

Document Identifiers

DOI: 10.4230/DagSemProc.06481.2
URN: urn:nbn:de:0030-drops-10282

Subject Classification

Keywords

Sensor networks
distance estimation
unit disk graphs.

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

We present an approach to estimating distances in sensor networks. It
works by counting common neighbors, high values indicating closeness.
Such distance estimates are needed in many self-localization
algorithms. Other than many other approaches, ours does not rely on
special equipment in the devices.

Cite As Get BibTex

Sándor Fekete, Alexander Kröller, Carsten Buschmann, and Stefan Fischer. Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs. In Geometric Networks and Metric Space Embeddings. Dagstuhl Seminar Proceedings, Volume 6481, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/DagSemProc.06481.2

Author Details

Sándor Fekete

Alexander Kröller

Carsten Buschmann

Stefan Fischer

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail