Home |  ENGLISH |  Kontakt |  Impressum |  Anmelden |  KIT


Aus Aifbportal

Wechseln zu: Navigation, Suche

(This page contains COinS metadata)

Distributed Geometric Distance Estimation in Ad Hoc Networks

Veröffentlicht: Juli 2012
Herausgeber: Xiang-Yang Li, Symeon Papavassiliou, and Stefan Ruehrup
Buchtitel: Ad-hoc, Mobile, and Wireless Networks
Ausgabe: 7363
Seiten: 28-41
Kapitel: 3
Reihe: Lecture Notes in Computer Science
Verlag: Springer
Erscheinungsort / Ort: Berlin Heidelberg
BibTex-ID: MMS12b

Distributed localization algorithms for nodes in ad hoc networks are essential for many applications. A major task when localizing nodes is to accurately estimate distances. So far, distance estimation is often based on counting the minimum number of nodes on the shortest routing path (hop count) and presuming a fixed width for one hop. This is prone to error as the length of one hop can vary significantly. In this paper, a distance estimation method is proposed, which relies on the number of shared communication neighbors and applies geometric properties to the network structure. It is shown that the geometric approach provides reliable estimates for the distance between any two adjacent nodes in a network. Experiments reveal that the estimation has less relative percentage error compared to a hop based algorithm in networks with different node distributions.

ISBN: 978-3-642-31637-1
Download: Media:GeoDE MMS12b.pdf
Weitere Informationen unter: Link
DOI Link: 10.1007/978-3-642-31638-8_3




Effiziente Algorithmen

Algorithmische Graphentheorie, Mobile Technologien, Verteilte Algorithmen