Sciweavers

Share
ICUMT
2009

sDLS - Distributed Least Squares localization for large Wireless Sensor Networks

9 years 3 months ago
sDLS - Distributed Least Squares localization for large Wireless Sensor Networks
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspect of WSN research is location estimation. As a good solution of fine grained localization Reichenbach et al. introduced the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation which is performed on constrained sensor nodes to finalize the localization by adding locale knowledge. This allows to perform an originally complex calculation with high precision on constrained nodes. Besides this advantage, DLS lacks in two harmful constraints concerning practical appliance. On the one hand the algorithm does not scale, i.e. calculation and communication increases with the number of beacon nodes or with network size, respectively. On the other hand DLS even does not work for large networks. An important assumption of DLS is that each blind node can communicate with each beacon node...
Ralf Behnke, Jakob Salzmann, Dominik Lieckfeldt, D
Added 19 Feb 2011
Updated 19 Feb 2011
Type Journal
Year 2009
Where ICUMT
Authors Ralf Behnke, Jakob Salzmann, Dominik Lieckfeldt, Dirk Timmermann
Comments (0)
books