License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06481.2
URN: urn:nbn:de:0030-drops-10282
URL: https://drops.dagstuhl.de/opus/volltexte/2007/1028/
Go to the corresponding Portal


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

Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs

pdf-format:
06481.FeketeSandor.Paper.1028.pdf (0.1 MB)


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.



BibTeX - Entry

@InProceedings{fekete_et_al:DagSemProc.06481.2,
  author =	{Fekete, S\'{a}ndor and Kr\"{o}ller, Alexander and Buschmann, Carsten and Fischer, Stefan},
  title =	{{Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs}},
  booktitle =	{Geometric Networks and Metric Space Embeddings},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6481},
  editor =	{Joachim Gudmundsson and Rolf Klein and Giri Narasimhan and Michiel Smid and Alexander Wolff},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/1028},
  URN =		{urn:nbn:de:0030-drops-10282},
  doi =		{10.4230/DagSemProc.06481.2},
  annote =	{Keywords: Sensor networks, distance estimation, unit disk graphs.}
}

Keywords: Sensor networks, distance estimation, unit disk graphs.
Collection: 06481 - Geometric Networks and Metric Space Embeddings
Issue Date: 2007
Date of publication: 01.06.2007


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI