Document Open Access Logo

Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm

Authors Rico Radeke, Stefan Türk



PDF
Thumbnail PDF

File

OASIcs.KiVS.2011.194.pdf
  • Filesize: 365 kB
  • 6 pages

Document Identifiers

Author Details

Rico Radeke
Stefan Türk

Cite AsGet BibTex

Rico Radeke and Stefan Türk. Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm. In 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011). Open Access Series in Informatics (OASIcs), Volume 17, pp. 194-199, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/OASIcs.KiVS.2011.194

Abstract

Hop-count based weighted centroid localization is a simple and straightforward localization algorithm, which uses anchors with known positions and the hop count to these anchors to estimate the real position of nodes. Especially in sensor networks, where energy restrictions prevent more complex algorithms, this fast and simple algorithm can be used. Unfortunately the localization error of the algorithm can hinder the practical usage. In this paper we will improve the weighted centroid algorithm for hop count based localization by adding the node degree on the paths to the referenced anchors into the weights. After an analysis to obtain theoretically optimal coefficients we will show by means of simulation that for longer hop counts to the anchors and areas with different node degrees the proposed ND-WCL algorithm outperforms the known hop count based weighted centroid localization algorithm.
Keywords
  • Localization
  • Weighted Centroid

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail