Abstract: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 perf… Show more
“…The simulator provides a realistic radio communication model, including spatial and temporal normal distributed fading, random transmission errors, collisions and a CSMA-CA MAC layer. As previously done in [5], a static bidirectional spanning-tree routing was used for communication.…”
Section: Simulationsmentioning
confidence: 99%
“…The described drawbacks have been overcome by scalable DLS (sDLS) [5], still saving the idea of DLS. The use of individual precalculations instead of only one precalculation for the whole network, as used by DLS, enabled sDLS to be used in large WSNs.…”
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects of WSN research is location estimation. A good solution of fine grained localization is the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation. The latter is performed on constrained sensor nodes, finalizing the localization by adding locale knowledge. This approach lacks for large WSNs, because cost of communication and computation theoretically increases with network size. In practice the approach is even unusable for large WSNs. An important assumption of DLS is that each blind node is able to communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. This restriction have been overcome by scalable DLS (sDLS), which enabled to use the idea of DLS in large WSN for the first time.Although, sDLS has lower cost of computation than DLS, for large networks, this cost, caused by matrix updates, is pretty high. In this work an adaptation of sDLS is presented, which dramatically reduces cost of computation by circumventing matrix updates as often as possible.
“…The simulator provides a realistic radio communication model, including spatial and temporal normal distributed fading, random transmission errors, collisions and a CSMA-CA MAC layer. As previously done in [5], a static bidirectional spanning-tree routing was used for communication.…”
Section: Simulationsmentioning
confidence: 99%
“…The described drawbacks have been overcome by scalable DLS (sDLS) [5], still saving the idea of DLS. The use of individual precalculations instead of only one precalculation for the whole network, as used by DLS, enabled sDLS to be used in large WSNs.…”
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects of WSN research is location estimation. A good solution of fine grained localization is the Distributed Least Squares (DLS) algorithm, which splits the costly localization process in a complex precalculation and a simple postcalculation. The latter is performed on constrained sensor nodes, finalizing the localization by adding locale knowledge. This approach lacks for large WSNs, because cost of communication and computation theoretically increases with network size. In practice the approach is even unusable for large WSNs. An important assumption of DLS is that each blind node is able to communicate with each beacon node to receive the precalculation and to determine distances to beacon nodes. This restriction have been overcome by scalable DLS (sDLS), which enabled to use the idea of DLS in large WSN for the first time.Although, sDLS has lower cost of computation than DLS, for large networks, this cost, caused by matrix updates, is pretty high. In this work an adaptation of sDLS is presented, which dramatically reduces cost of computation by circumventing matrix updates as often as possible.
“…The described drawbacks have been overcome by scalable DLS (sDLS) [6], still saving the idea of DLS. Utilization of individual precalculations instead of only one precalculation, as done by DLS, enabled sDLS to be used in large WSNs.…”
Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects 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 local knowledge. This approach lacks for large WSNs, because cost of communication and computation theoretically increases with the network size. In practice the approach is even unusable for large WSNs. This restriction have been overcome by scalable DLS (sDLS), which enabled to use the idea of DLS in large WSNs for the first time. Although, sDLS outperforms DLS for large networks, cost of communication and computation is initially higher for small networks, caused by data updates. The approach, presented in this work, dramatically reduces cost of communication of sDLS. Additionally, a new approach of distance estimation is applied to original DLS. In contrast to earlier simulations, this leads to improved localization, which is used for fairer comparison.
“…Several methods are described in [18] through different measurements such as a distance and a direction, two directions, or three distances. Least-square (LS) was widely used for position estimation [19], [20]. A new method was presented by splitting the complex least-square algorithm into a less central precalculation and a simple, distributed subcalculation in [21].…”
Wireless sensor network localization is an essential problem that has attracted increasing attention due to wide requirements such as in-door navigation, autonomous vehicle, intrusion detection, and so on. With the a priori knowledge of the positions of sensor nodes and their measurements to targets in the wireless sensor networks (WSNs), i.e. posterior knowledge, such as distance and angle measurements, it is possible to estimate the position of targets through different algorithms. In this contribution, two approaches based on least-squares and Kalman filter are described for localization of one static target in the WSNs with distance, angle, or both distance and angle measurements, respectively. Noting that the measurements of these sensors are generally noisy of certain degree, it is crucial and interesting to analyze how the accuracy of localization is affected by the sensor errors and the sensor network, which may help to provide guideline on choosing the specification of sensors and designing the sensor network. To this end, we make theoretical analysis for the different methods based on three types of measurement noise: bounded noise, uniformly distributed noises, and Gaussian white noises. Simulation results illustrate the performance comparison of these different methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.