10.4230/OASICS.KIVS.2011.194
Radeke, Rico
Rico
Radeke
Türk, Stefan
Stefan
Türk
Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Article
Localization
Weighted Centroid
Luttenberger, Norbert
Norbert
Luttenberger
Peters, Hagen
Hagen
Peters
2011
2011-02-25
2011-02-25
2011-02-25
en
urn:nbn:de:0030-drops-29726
10.4230/OASIcs.KiVS.2011
978-3-939897-27-9
2190-6807
10.4230/OASIcs.KiVS.2011
OASIcs, Volume 17, KiVS 2011
17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011)
2012
17
19
194
199
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Luttenberger, Norbert
Norbert
Luttenberger
Peters, Hagen
Hagen
Peters
2190-6807
Open Access Series in Informatics (OASIcs)
2011
17
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
6 pages
374363 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
OASIcs, Vol. 17, 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011), pages 194-199